Low-density MDS codes and factors of complete graphs

DOI10.1109/18.782102MaRDI QIDQ4503388zbMATH OpenOpenAlexFDO

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

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

array codeslow densityMDS codesoptimal lengthperfect one-factorizationupdate complexity

Mathematics Subject Classification ID

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

Recommendations

• Cycle codes of graphs and MDS array codes
• Lowest density MDS codes over extension alphabets
• On lowest density MDS codes
• X-code: MDS array codes with optimal encoding
• Graphical codes revisited

Cited in

(8)

• Distance-2 MDS codes and Latin colorings in the Doob graphs
• X-code double parity array operation with two disk failures
• A complete classification of partial MDS (maximally recoverable) codes with one global parity
• On encoding symbol degrees of array BP-XOR codes
• Perfect one-factorizations arising from the Lee metric
• Cycle codes of graphs and MDS array codes
• The independence number of the Birkhoff polytope graph, and applications to maximally recoverable codes
• Linear codes in the folded Hamming distance and the quasi MDS property

Describes a project that uses

Uses Software

• EVENODD

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503388)