Recoverability study of SPC product codes under erasure decoding

DOI10.1016/J.INS.2004.07.011MaRDI QIDQ2568274zbMATH OpenOpenAlexFDO

Authors R. Senthil Amutha, K. Verraraghavan, S. K. Srivatsa

Publication date 10 October 2005

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2004.07.011

zbMATH Keywords

Erasure decodingProduct codeRecoverable basic patternSingle parity check (SPC) codesUnrecoverable basic pattern

Mathematics Subject Classification ID

Other types of codes (94B60)

Recommendations

• An approach to the performance of SPC product codes on the erasure channel
• SPC product codes over the erasure channel
• Error-erasure decoding of product codes (Corresp.)
• SPC product codes, graphs with cycles and Kostka numbers
• Single parity check product codes

Cites work

• VLSI architecture of modified Euclidean algorithm for Reed-Solomon code.

Cited in

(3)

• On quantum SPC product codes
• An approach to the performance of SPC product codes on the erasure channel
• SPC product codes over the erasure channel

This page was built for publication: Recoverability study of SPC product codes under erasure decoding

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