Low-density MDS codes and factors of complete graphs

IEEE Transactions on Information Theory

Volumn 45, Issue 6, 1999, Pages 1817-1826

  Xu, Lihao ^a   Bohossian, Vasken ^b   Bruck, Jehoshua ^c   Wagner, David G ^a  

^a WASHINGTON UNIVERSITY   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Array codes; Low density; Mds codes; Perfect one factorization; Update complexity

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; DECODING; ERROR CORRECTION; GRAPH THEORY; OPTIMIZATION; SIGNAL ENCODING;

ARRAY CODES; LOW DENSITY; MAXIMUM DISTANCE SEPARABLE; PERFECT ONE FACTORIZATION;

CODES (SYMBOLS);

EID: 0033184925     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.782102     Document Type: Article

References (18)

1. B. A. Anderson, "Symmetry groups of some perfect 1-factorizations of complete graphs," Discr. Math., vol. 18, pp. 227-234, 1977.
2. M. Blaum, J. Brady, J. Brück, and J. Menon, "EVENODD: An efficient scheme for tolerating double disk failures in RAID architectures," IEEE Trans. CompuL. vol. 44, pp. 192-202, Feb. 1995.
3. M. Blaum, J. Brück, and A. Vardy, "MDS array codes with independent parity symbols," IEEE Trans. Inform. Theory, vol. 42, pp. 529-542, Mar. 1996.
4. M. Blaum and R. M. Roth, "New array codes for multiple phased burst correction," IEEE Trans. Inform. Theory, vol. 39, pp. 66-77, Jan. 1993.
5. "On lowest-density MDS codes," IEEE Trans. Inform. Theory, vol. 45, pp. 46-59, Jan. 1999.
6. M. Blaum, P. G. Farrell, and H. C. A. van Tilborg, "Chapter on array codes," in Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: North-Holland, 1998, pp. 1855-1909.
7. P. G. Farrell, "A survey of array error control codes," ETT, vol. 3, no. 5, pp. 441-454, 1992.
8. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
9. R. M. Goodman, R. J. McEliece, and M. Sayano, "Phased burst error correcting arrays codes," IEEE Trans. Inform. Theory, vol. 39, pp. 684-693, 1993.
10. 2P," Graphs Combinatorics, vol. 5, pp. 351-353, 1989.
11. A. Kotzig, "Hamilton graphs and Hamilton circuits," in Theory of Graphs and Its Applications (Proc. Symp.) (Smolenice), 1963, pp. 63-82.
12. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
13. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
14. D. G. Wagner, "On the perfect one-factorization conjecture," Discr. Math. , vol. 104, pp. 211-215, 1992.
15. W. D. Wallis, One-Factorizations. Norwell, MA: Kluwer, 1997.
16. S. B. Wicker, Error Control Systems for Digital Communication and Storage. Englewood Cliffs, NJ: Prentice-Hall, 1995
17. L. Xu and J. Brück, "X-Code: MDS array codes with optimal encoding," IEEE Trans. Inform. Theory, vol. 45, pp. 272-276, Jan. 1999.
18. G. V. Zaitsev, V. A. Zinov'ev, and N. V. Semakov, "Minimum-check-density codes for correcting bytes of errors, erasures, or defects," Probl. Inform. Transm., vol. 19, no. 3, pp. 197-204, 1983.