Codes for error detection, good or not good
Information Theory
2007-07-16 v1 math.IT
Abstract
Linear codes for error detection on a q-ary symmetric channel are studied. It is shown that for given dimension k and minimum distance d, there exists a value \mu(d,k) such that if C is a code of length n >= \mu(d,k), then neither C nor its dual are good for error detection. For d >> k or k << d good approximations for \mu(d,k) are given. A generalization to non-linear codes is also given.
Cite
@article{arxiv.cs/0508035,
title = {Codes for error detection, good or not good},
author = {Irina Naydenova and Torleiv Klove},
journal= {arXiv preprint arXiv:cs/0508035},
year = {2007}
}
Comments
To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005