Low-density MDS codes and factors of complete graphs

DOI10.1109/18.782102zbMath0958.94034OpenAlexW2147323018MaRDI QIDQ4503388

David G. Wagner, Jehoshua Bruck, Vasken Bohossian, Lihao Xu

Publication date: 7 September 2000

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://authors.library.caltech.edu/5193/

zbMATH Keywords

MDS codeslow densityarray codesoptimal lengthperfect one-factorizationupdate complexity

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Decoding (94B35)

Related Items (4)

On encoding symbol degrees of array BP-XOR codes ⋮ Perfect one-factorizations arising from the Lee metric ⋮ X-code double parity array operation with two disk failures ⋮ Cycle codes of graphs and MDS array codes

Uses Software

• EVENODD

This page was built for publication: Low-density MDS codes and factors of complete graphs