2005/08/04 by Irina Naydenova, Naydenova, Irina, Torleiv Kløve +2
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Coding theory and cryptography #E.4 #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.cs/0508035
To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005
arxiv created 2005/08/04 · openalex publication_date 2005/08/04 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 μ(d,k) such that if C is a code of length n >= μ(d,k), then neither C nor its dual are good for error detection. For d >> k or k << d good approximations for μ(d,k) are given. A generalization to non-linear codes is also given.