Cycle codes of graphs and MDS array codes

DOI10.1016/j.endm.2009.07.016zbMath1273.94411OpenAlexW2076834092MaRDI QIDQ2851446

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)

Cites Work

• Unnamed Item
• Minimum-check-density codes for correcting bytes of errors, erasures, or defects
• A family of perfect factorisations of complete bipartite graphs
• Low-density MDS codes and factors of complete graphs
• On lowest density MDS codes

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