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

DOI10.3934/AMC.2015.9.149MaRDI QIDQ2346708zbMATH OpenOpenAlexFDO

Authors 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)

Abstract: In this paper, a refinement of the weight distribution in an MDS code is computed. Concretely, the number of codewords with a fixed amount of nonzero bits in both information and redundancy parts is obtained. This refinement improves the theoretical approximation of the information-bit and -symbol error rate, in terms of the channel bit-error rate, in a block transmission through a discrete memoryless channel. Since a bounded distance reproducing encoder is assumed, the computation of the here-called false positive (a decoding failure with no information-symbol error) is provided. As a consequence, a new performance analysis of an MDS code is proposed.

Recommendations

• On the computation of the performance probabilities for block codes with a bounded-distance decoding rule
• scientific article; zbMATH DE number 4057436
• scientific article; zbMATH DE number 4021023
• A note on the computation of the bit error rate for binary block codes
• On the Probability of Undetected Error for the Maximum Distance Separable Codes

Cites work

• scientific article; zbMATH DE number 53946 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• A course in combinatorics.
• A survey on proper codes
• Error probabilities for bounded distance decoding
• Information-bit, information-symbol, and decoded-symbol error rates for linear block codes
• On the Probability of Undetected Error for Overextended Reed–Solomon Codes
• On the Probability of Undetected Error for the Maximum Distance Separable Codes
• Sufficient conditions for good and proper error-detecting codes
• The MMD codes are proper for error detection

Cited in

(1)

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

Describes a project that uses

Uses Software

• SageMath

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

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