SPC product codes, graphs with cycles and Kostka numbers

DOI10.1007/s13398-019-00698-1zbMath1423.94143OpenAlexW2953315237WikidataQ127655978 ScholiaQ127655978MaRDI QIDQ2331735

Sara D. Cardell, Joan-Josep Climent, Alberto López Martín

Publication date: 30 October 2019

Published in: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10045/95531

zbMATH Keywords

bipartite graphSPC codeKostka numberErasure channelErasure pattern

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Enumeration in graph theory (05C30)

Related Items (2)

Independence number of graphs and line graphs of trees by means of omega invariant ⋮ On nonsingular acyclic M-matrices whose inverse is also acyclic

Cites Work

• An approach to the performance of SPC product codes on the erasure channel
• Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
• Single parity check product codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: SPC product codes, graphs with cycles and Kostka numbers