The stopping distance of binary BCH-code parity-check matrices

MaRDI QIDQ2918570zbMATH OpenFDO

Authors Z. Hooshmand, Morteza Esmaeili

Publication date 8 October 2012

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

BCH codestopping setstopping distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Stopping sets of binary parity-check matrices with constant weight columns and stopping redundancy of the associated codes
• Two classes of optimal stopping redundancy codes.
• On the stopping distance and the stopping redundancy of codes
• Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes
• On the Stopping Redundancy of Reed–Muller Codes

Cited in

(2)

• Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices”
• Stopping sets of binary parity-check matrices with constant weight columns and stopping redundancy of the associated codes

This page was built for publication: The stopping distance of binary BCH-code parity-check matrices

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