Two classes of optimal stopping redundancy codes.

MaRDI QIDQ3011779zbMATH OpenFDO

Authors Vida Ravanmehr, Morteza Esmaeili

Publication date 29 June 2011

zbMATH Keywords

stopping distancestopping redundancystopping set

Mathematics Subject Classification ID

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

Recommendations

• Stopping sets of binary parity-check matrices with constant weight columns and stopping redundancy of the associated codes
• On the stopping distance and the stopping redundancy of codes
• On the Stopping Redundancy of Reed–Muller Codes
• Improved Probabilistic Bounds on Stopping Redundancy
• Improved Upper Bounds on Stopping Redundancy

Cited in

(8)

• The stopping distance of binary BCH-code parity-check matrices
• Stopping sets of binary parity-check matrices with constant weight columns and stopping redundancy of the associated codes
• On the stopping distance and the stopping redundancy of codes
• On the Stopping Redundancy of Reed–Muller Codes
• Improved Upper Bounds on Stopping Redundancy
• Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes
• Improved Probabilistic Bounds on Stopping Redundancy
• Average Stopping Set Weight Distributions of Redundant Random Ensembles

This page was built for publication: Two classes of optimal stopping redundancy codes.

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