Codes for error detection, good or not good
<|reference_start|>Codes for error detection, good or not good: 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.<|reference_end|>
@article{naydenova2005codes,
    title={Codes for error detection, good or not good},
    author={Irina Naydenova, Torleiv Klove},
    journal={arXiv preprint arXiv:cs/0508035},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0508035},
    primaryClass={cs.IT math.IT}
}