An approach to the performance of SPC product codes on the erasure channel

DOI10.3934/AMC.2016.10.11zbMath1331.94081OpenAlexW2324225289MaRDI QIDQ259259

Joan-Josep Climent, Sara D. Cardell

Publication date: 11 March 2016

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2016.10.11

zbMATH Keywords

bipartite grapherasure channelconnected componenterasure patternSPC code

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (1)

SPC product codes, graphs with cycles and Kostka numbers

Cites Work

• On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)
• Recoverability study of SPC product codes under erasure decoding
• Single parity check product codes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approach to the performance of SPC product codes on the erasure channel