Error-Correction Capability of Binary Linear Codes

DOI10.1109/TIT.2005.844080MaRDI QIDQ3546994zbMATH OpenOpenAlexFDO

Authors Tor Helleseth, Torleiv Kløve, Vladimir Levenshtein

Publication date 21 December 2008

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

Full work available at URL https://doi.org/10.1109/tit.2005.844080

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Error probability in coding theory (94B70)

Recommendations

• On the complete decoding of binary linear codes (Corresp.)
• scientific article; zbMATH DE number 1456837
• The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction
• Random and burst error correcting linear codes
• scientific article; zbMATH DE number 1153457

Cited in

(31)

• On the error-correcting performance of some binary and ternary linear codes
• Correctable Errors of Weight Half the Minimum Distance Plus One for the First-Order Reed-Muller Codes
• Computing coset leaders and leader codewords of binary codes
• The decodability and correctability of codes
• On error correction with errors in both the channel and syndrome
• The (d,k) subcode of a linear block code
• Correcting a specified set of likely error patterns
• On the complete decoding of binary linear codes (Corresp.)
• On the weak order ideal associated to linear codes
• On the Mollard code as a partially robust code
• scientific article; zbMATH DE number 78004 (Why is no real title available?)
• 2^-incorrigible set distributions of some linear codes by the finite geometry
• Error-correction capability of Reed-Muller codes
• Codes of length two correcting single errors of limited size
• A reduced upper bound on the error correction ability of codes (Corresp.)
• Lexicographically smallest minimum weight vectors in binary codes
• New constructions of 2-to-1 mappings over \(\mathbb{F}_{2^n}\) and their applications to binary linear codes
• scientific article; zbMATH DE number 1188997 (Why is no real title available?)
• scientific article; zbMATH DE number 842890 (Why is no real title available?)
• Trial set and Gröbner bases for binary codes
• Reed-Muller Codes
• scientific article; zbMATH DE number 3693152 (Why is no real title available?)
• Singleton-type bounds for blot-correcting codes
• Gröbner bases and combinatorics for binary codes
• The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction
• Computing an invariant of a linear code
• On the error-correcting capability of LDPC codes
• Configuration in binary linear codes
• On the minimum bit-error rate of linear codes
• scientific article; zbMATH DE number 5005895 (Why is no real title available?)
• Linear codes with non-uniform error correction capability

This page was built for publication: Error-Correction Capability of Binary Linear Codes

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