Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Cycle codes of graphs and MDS array codes

Autor
Serra, O.; Zemor, G.
Tipus d'activitat
Article en revista
Revista
Electronic notes in discrete mathematics
Data de publicació
2009-07-30
Número
34
Pàgina inicial
95
Pàgina final
99
DOI
https://doi.org/10.1016/j.endm.2009.07.016 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/6739 Obrir en finestra nova
Resum
We investigate how to colour edges of graph so that any two colours make up a spanning tree. This problem is equivalent to transforming the cycle code of a graph into a Maximum Distance Separable (MDS) array code. Adopting this graph-theoretical interpretation allows us to provide a compact description of some families of low density MDS array codes in terms of cycle codes of coloured graphs. This includes a short description of Xu et al.’s “B-code”, together with its erasure and error dec...
Citació
Serra, O.; Zemor, G. Cycle codes of graphs and MDS array codes. "Electronic notes in discrete mathematics", 30 Juliol 2009, núm. 34, p. 95-99.
Grup de recerca
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

Participants