Cycle codes of graphs and MDS array codes

DOI10.1016/J.ENDM.2009.07.016MaRDI QIDQ2851446zbMATH OpenOpenAlexFDO

Authors Oriol Serra, Gilles Zémor

Publication date 10 October 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.07.016

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial codes (94B25)

Recommendations

• Low-density MDS codes and factors of complete graphs
• Graphical codes revisited
• scientific article; zbMATH DE number 1424165
• Optimal Cycle Codes Constructed From Ramanujan Graphs
• MDS array codes with independent parity symbols

Cites work

• A family of perfect factorisations of complete bipartite graphs
• scientific article; zbMATH DE number 3276424 (Why is no real title available?)
• Low-density MDS codes and factors of complete graphs
• Minimum-check-density codes for correcting bytes of errors, erasures, or defects
• On lowest density MDS codes

Cited in

(2)

• The Maximum-Likelihood Decoding Threshold for Cycle Codes of Graphs
• Low-density MDS codes and factors of complete graphs

This page was built for publication: Cycle codes of graphs and MDS array codes

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