Improved Probabilistic Bounds on Stopping Redundancy

DOI10.1109/TIT.2008.917624MaRDI QIDQ3604449zbMATH OpenOpenAlexFDO

Authors Junsheng Han, Alexander Vardy, Paul Siegel

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4475352&arnumber=4475370&count=44&index=28

Mathematics Subject Classification ID

Combinatorial probability (60C05) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

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

Cited in

(5)

• On the stopping distance and the stopping redundancy of codes
• Bounds on the Expansion Properties of Tanner Graphs
• Two classes of optimal stopping redundancy codes.
• Improved Upper Bounds on Stopping Redundancy
• The effect of redundancy on probability bounds

This page was built for publication: Improved Probabilistic Bounds on Stopping Redundancy

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