Information-bit error rate and false positives in an MDS code
Information Theory
2016-07-26 v3 math.IT
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.
Cite
@article{arxiv.1207.2734,
title = {Information-bit error rate and false positives in an MDS code},
author = {F. J. Lobillo and Gabriel Navarro and José Gómez-Torrecillas},
journal= {arXiv preprint arXiv:1207.2734},
year = {2016}
}