arXiv Open Access 2015

Multi-Version Coding

Majid Khabbazian

Lihat Sumber

Abstrak

We derive a simple lower bound for the multi-version coding problem formulated in [1]. We also propose simple algorithms that almost match the lower bound derived. Another lower bound is proven for an extended version of the multi-version coding problem introduced in [2].

Topik & Kata Kunci

cs.DC

Penulis (1)

Majid Khabbazian

Format Sitasi

APA MLA BibTeX

Khabbazian, M. (2015). Multi-Version Coding. https://arxiv.org/abs/1503.06479

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2015
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓