Abstract :
It has been shown by Kasami and Lin (see IEEE Trans. Commun., vol.32, p.998, 1984) that (n,k) Reed-Solomon codes used over a q-ary symmetric channel are proper. In this correspondence, it is shown that the binary expansions of these codes and their extensions, when used on the binary-symmetric channel, are not necessarily proper. In particular, certain codes of rate less than [1-log2m+{(m-1)/m}log2 (m-1)] where m=log2 q are not proper
Keywords :
Reed-Solomon codes; error statistics; telecommunication channels; Reed-Solomon codes; binary expansions; binary-symmetric channel; q-ary symmetric channel; undetected error probability; Algorithm design and analysis; Decoding; Electrons; Equations; Error probability; Memoryless systems; Reed-Solomon codes; Registers; Signal processing algorithms; Testing;
