Stopping sets of binary parity-check matrices with constant weight columns and stopping redundancy of the associated codes

MaRDI QIDQ3534288zbMATH OpenFDO

Authors Vida Ravanmehr, Morteza Esmaeili

Publication date 3 November 2008

zbMATH Keywords

stopping setstopping distanceoptimal redundancystopping redundancyconstant weight parity-check matrices

Mathematics Subject Classification ID

Matrices of integers (15B36) Linear codes (general theory) (94B05)

Recommendations

• Two classes of optimal stopping redundancy codes.
• The stopping distance of binary BCH-code parity-check matrices
• On the stopping distance and the stopping redundancy of codes
• On the Stopping Redundancy of Reed–Muller Codes
• Improved Upper Bounds on Stopping Redundancy

Cited in

(8)

• The stopping distance of binary BCH-code parity-check matrices
• Average Stopping Set Weight Distributions of Redundant Random Ensembles
• Improved Probabilistic Bounds on Stopping Redundancy
• On the stopping distance and the stopping redundancy of codes
• Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices”
• Two classes of optimal stopping redundancy codes.
• Stopping Set Analysis of Iterative Row-Column Decoding of Product Codes
• Improved Upper Bounds on Stopping Redundancy

This page was built for publication: Stopping sets of binary parity-check matrices with constant weight columns and stopping redundancy of the associated codes

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