Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 1, 1998 | public
Book Section - Chapter Open

Low density MDS codes and factors of complete graphs

Abstract

We reveal an equivalence relation between the construction of a new class of low density MDS array codes, that we call B-Code, and a combinatorial problem known as perfect one-factorization of complete graphs. We use known perfect one-factors of complete graphs to create constructions and decoding algorithms for both B-Code and its dual code. B-Code and its dual are optimal in the sense that (i) they are MDS, (ii) they have an optimal encoding property, i.e., the number of the parity bits that are affected by change of a single information bit is minimal and (iii) they have optimal length. The existence of perfect one-factorizations for every complete graph with an even number of nodes is a 35 years long conjecture in graph theory. The construction of B-codes of arbitrary odd length will provide an affirmative answer to the conjecture.

Additional Information

© 1998 IEEE. Reprinted with Permission. Publication Date: 16-21 Aug. 1998. Supported in part by the NSF Young Investigator Award CCR-9457811, by an IBM Partnership Award, by the Sloan Research Fellowship, and by DARPA through an agreement with NASA/OSAT.

Files

XULisit98.pdf
Files (115.3 kB)
Name Size Download all
md5:215a9df32decc6c765e5a646543ec81f
115.3 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023