Improved Probabilistic Bounds on Stopping Redundancy

No abstract is available for this paper.

• Publication year

  2008

• Venue

  IEEE Transactions on Information Theory

• Publication date

  2008-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TIT.2008.917624
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Probabilistic Method

  2015cited by this paper
• Bounds on Single-Exclusion Numbers and Stopping Redundancy of MDS Codes

  2007cited by this paper
• An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices

  2007cited by this paper
• Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes

  2007cited by this paper
• Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block Codes

  2007cited by this paper
• Stopping and Trapping Sets in Generalized Covering Arrays

  2006cited by this paper
• Generating parity check equations for bounded-distance iterative erasure decoding

  2006cited by this paper
• Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes

  2006cited by this paper
• Generic erasure correcting sets: Bounds and constructions

  2006cited by this paper
• The stopping redundancy hierarchy of cyclic codes

  2006cited by this paper
• On the Stopping Redundancy of Reed-Muller Codes

  2006influential reference
• On the stopping distance and the stopping redundancy of codes

  2005cited by this paper
• On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size

  2005cited by this paper
• Stopping set analysis for Hamming codes

  2005cited by this paper
• Improved Upper Bounds on Stopping Redundancy

  2005cited by this paper
• Optimal binary phase codes and sidelobe-free decoding filters with application to incoherent scatter radar

  2004cited by this paper
• Mismatched filtering of periodic quadriphase and 8-phase sequences

  2003cited by this paper
• Finite-length analysis of low-density parity-check codes on the binary erasure channel

  2002cited by this paper
• The Probabilistic Method

  1998cited by this paper
• On the search for good aperiodic binary invertible sequences

  1996cited by this paper
• Best quadriphase codes up to length 24

  1993cited by this paper
• Mismatched-filter design for periodic binary phased signals

  1989cited by this paper
• Maximum-likelihood estimation of multipath channels

  1989cited by this paper
• Quadriphase code-a radar pulse compression signal with unique characteristics

  1988influential reference
• A new modulation principle for incoherent scatter measurements

  1987cited by this paper
• The Theory of Error-Correcting Codes

  1977cited by this paper
• Binary sequences up to length 40 with best possible autocorrelation function

  1975cited by this paper
• Four-phase Barker codes

  1974influential reference
• On the Limit Distribution of the Number of Solutions of a Random System of Linear Equations in the Class of Boolean Functions

  1967cited by this paper
• Generalized Barker sequences

  1965cited by this paper
• Methoden der mathematischen Physik

  1944cited by this paper
• Theory of Error-correcting Codes

  year unknowncited by this paper

• Improved iterative decoding of QC-MDPC codes in the McEliece public key cryptosystem

  2019cites this paper
• Small stopping sets in projective low-density parity-check codes

  2019cites this paper
• Stopping Redundancy Hierarchy Beyond the Minimum Distance

  2018influential citation
• A pr 2 01 6 Probabilistic bounds on the trapping redundancy of linear codes

  2018cites this paper
• Average spectra for ensembles of LDPC codes and applications

  2017cites this paper
• Probabilistic bounds on the trapping redundancy of linear codes

  2016cites this paper
• Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes

  2016cites this paper
• Refined upper bounds on stopping redundancy of binary linear codes

  2014cites this paper
• Optimization of Parity-Check Matrices of LDPC Codes

  2014influential citation
• Incorrigible set distributions and unsuccessful decoding probability of linear codes

  2013cites this paper
• Parity-Check Matrices Separating Erasures From Errors

  2013cites this paper
• Stopping Sets of Algebraic Geometry Codes

  2013cites this paper
• Separating redundancy of linear MDS codes

  2013cites this paper
• Additional check node to improve the performance of LDPC codes in the error floor region

  2012cites this paper
• Stopping Set Distributions of Algebraic Geometry Codes from Elliptic Curves

  2012cites this paper
• Stopping Set Distributions of Some Reed–Muller Codes

  2011cites this paper
• On Generic Erasure Correcting Sets and Related Problems

  2011influential citation
• An upper bound on the separating redundancy of linear block codes

  2010cites this paper
• On the probabilistic computation of the stopping redundancy of LDPC codes

  2009cites this paper
• Decreasing error floor in LDPC codes by parity-check matrix extensions

  2009cites this paper
• Single-Exclusion Number and the Stopping Redundancy of MDS Codes

  2007cites this paper
• Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes

  2007cites this paper
• Stopping Set Distributions of Some Linear Codes

  2006cites this paper