Information-bit error rate and false positives in an MDS code

DOI10.3934/amc.2015.9.149zbMath1369.94593arXiv1207.2734OpenAlexW3101798211MaRDI QIDQ2346708

F. J. Lobillo, Gabriel Navarro, José Gómez-Torrecillas

Publication date: 3 June 2015

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.2734

zbMATH Keywords

MDS codefalse positiveblock error-correcting codebit-error rate (BER)information-bit error rate (iber)

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Related Items (1)

How to obtain lattices from \((f,\sigma,\delta)\)-codes via a generalization of construction A

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Error probabilities for bounded distance decoding
• On the Probability of Undetected Error for the Maximum Distance Separable Codes
• On the Probability of Undetected Error for Overextended Reed–Solomon Codes
• Information-bit, information-symbol, and decoded-symbol error rates for linear block codes
• Sufficient conditions for good and proper error-detecting codes
• The MMD codes are proper for error detection
• A survey on proper codes

This page was built for publication: Information-bit error rate and false positives in an MDS code