pith. sign in

arxiv: 1207.2734 · v3 · pith:SR2Q7UR3new · submitted 2012-07-11 · 💻 cs.IT · math.IT

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

classification 💻 cs.IT math.IT
keywords codeerrorratechannelfalseinformation-bitrefinementamount
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.