Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities

DOI10.1007/S11122-005-0023-5MaRDI QIDQ2432944zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 26 October 2006

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11122-005-0023-5

zbMATH Keywords

Griesner codes

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Linear codes (general theory) (94B05) Bounds on codes (94B65) Channel models (including quantum) in information and communication theory (94A40) Error probability in coding theory (94B70)

Recommendations

• Sufficient conditions for interval properness of linear error detecting codes
• Publication:4504267
• A survey on proper codes
• Sufficient conditions for good and proper error-detecting codes
• Bounds on the undetected error probabilities of linear codes for both error correction and detection

Cites work

• scientific article; zbMATH DE number 1001631 (Why is no real title available?)
• scientific article; zbMATH DE number 3877079 (Why is no real title available?)
• scientific article; zbMATH DE number 4055530 (Why is no real title available?)
• scientific article; zbMATH DE number 1188997 (Why is no real title available?)
• scientific article; zbMATH DE number 3700716 (Why is no real title available?)
• scientific article; zbMATH DE number 1209696 (Why is no real title available?)
• scientific article; zbMATH DE number 1505483 (Why is no real title available?)
• scientific article; zbMATH DE number 3336526 (Why is no real title available?)
• A characterization of MMD codes
• A new class of codes meeting the Griesmer bound
• A survey on proper codes
• Characterization of two classes of codes that attain the Griesmer bound
• Codes and projective multisets
• Error Detection With a Class of Irreducible Binary Cyclic Codes and Their Dual Codes
• Further classifications of codes meeting the Griesmer bound (Corresp.)
• On some properties of the undetected error probability of linear codes (Corresp.)
• On the error-detecting performance of some classes of block codes
• On the inherent intractability of certain coding problems (Corresp.)
• On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
• Sufficient conditions for good and proper error-detecting codes
• The MMD codes are proper for error detection
• The duals of mmd codes are proper for error detection

Cited in

(11)

• On the error-correcting performance of some binary and ternary linear codes
• Sufficient conditions for interval properness of linear error detecting codes
• A sufficient condition for properness of a linear error-detecting code and its dual
• The duals of mmd codes are proper for error detection
• Almost-MDS and near-MDS codes for error detection
• Error detection with a class of cyclic codes
• scientific article; zbMATH DE number 1505483 (Why is no real title available?)
• The MMD codes are proper for error detection
• Necessary conditions for good error detection
• Using codes for error correction and detection (Corresp.)
• A survey on proper codes

This page was built for publication: Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities

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