The worst case probability of undetected error for linear codes on the local binomial channel

DOI10.1109/18.481787zbMATH Open0851.94030OpenAlexW2130798072MaRDI QIDQ4879999FDOQ4879999

Torleiv Kløve

Publication date: 24 November 1996

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

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

Recommendations

• Bounds on the worst case probability of undetected error
• Undetected error probabilities of codes for single-error correction and error detection
• Bounds on the undetected error probabilities of linear codes for both error correction and detection
• Linear block codes for error detection (Corresp.)

zbMATH Keywords

linear codeerror detectionundetected errorlocal binomial channelworst case probability

Mathematics Subject Classification ID

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

Cited In (4)

• Finite projective geometries and classification of the weight hierarchies of codes. I
• The weight hierarchies of \(q\)-ary linear codes of dimension 4
• Weight hierarchies of linear codes of dimension 3
• Code constructions and existence bounds for relative generalized Hamming weight

This page was built for publication: The worst case probability of undetected error for linear codes on the local binomial channel

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