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

DOI10.3934/AMC.2016.10.11MaRDI QIDQ259259zbMATH OpenOpenAlexFDO

Authors Sara D. Cardell, Joan-Josep Climent

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 graphconnected componenterasure channelerasure patternSPC code

Mathematics Subject Classification ID

Other types of codes (94B60)

Recommendations

• SPC product codes over the erasure channel
• Recoverability study of SPC product codes under erasure decoding
• SPC product codes, graphs with cycles and Kostka numbers
• Single parity check product codes
• Error-erasure decoding of product codes (Corresp.)

Cites work

• Graph theory.
• Graphs, surfaces and homology
• scientific article; zbMATH DE number 4142059 (Why is no real title available?)
• 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

Cited in

(6)

• SPC product codes, graphs with cycles and Kostka numbers
• Recoverability study of SPC product codes under erasure decoding
• SPC product codes over the erasure channel
• Asymptotic performance of single parity-check product codes
• Single parity check product codes
• Error-erasure decoding of product codes (Corresp.)

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

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