Error detecting codes for the q-ary symmetric channel

Manish Manish, Gupta, Jaskam +5 more

황규호

Irina Naydenova, Torleiv Kløve

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.

I. Gancheva, Torleiv Kløve

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 /spl mu/(d, k) such that if C is a code of length n /spl ges/ /spl mu/(d,k), then neither C nor its dual C/sup /spl perp// are good for error detection. For d /spl Gt/ k or k /spl Gt/ d good approximations for /spl mu/(d, k) are given. A generalization to nonlinear codes is also given.

晴彦 金子, Haruhiko Kaneko, 英二 藤原 +1 more

Haruhiko Kaneko, Eiji Fujiwara