Codes for error detection, good or not good

Simple item page
dc.creatorNaydenova, Irina
dc.creatorKlove, Torleiv
dc.date2005-08-04
dc.date.accessioned2026-07-07T08:17:49Z
dc.date.available2026-07-07T08:17:49Z
dc.descriptionLinear 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.
dc.descriptionTo appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005
dc.identifierhttps://arxiv.org/abs/cs/0508035
dc.identifierhttp://arxiv.org/abs/cs/0508035
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134224
dc.subjectInformation Theory
dc.subjectE.4
dc.titleCodes for error detection, good or not good
dc.typetext

Files

Collections

arXiv