Erasure correction performance of linear block codes

DOI10.1007/3-540-57843-9_32MaRDI QIDQ4954437zbMATH OpenFDO

Authors I. I. Dumer, Paddy G. Farrell

Publication date 7 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57843-9_32

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• Error-Correction Capability of Binary Linear Codes
• Efficient erasure correcting codes
• Algebraic Codes Achieving the Capacity of the Binary Symmetric Channel
• On the computation of the performance probabilities for block codes with a bounded-distance decoding rule
• New sequences of linear time erasure codes approaching the channel capacity

Cited in

(13)

• Erasure correction by low-density codes
• Error performance of mismatched receivers for linear-coded modulation
• 2^-incorrigible set distributions of some linear codes by the finite geometry
• Algebraic Codes Achieving the Capacity of the Binary Symmetric Channel
• Error-Correction Capability of Binary Linear Codes
• Coding in the Block-Erasure Channel
• A New Upper Bound on the Block Error Probability After Decoding Over the Erasure Channel
• scientific article; zbMATH DE number 5759480 (Why is no real title available?)
• scientific article; zbMATH DE number 4057436 (Why is no real title available?)
• scientific article; zbMATH DE number 1188997 (Why is no real title available?)
• scientific article; zbMATH DE number 493100 (Why is no real title available?)
• scientific article; zbMATH DE number 3321828 (Why is no real title available?)
• Reed-Muller Codes

This page was built for publication: Erasure correction performance of linear block codes

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