A new scheme for the construction of m-out-of* codesbased on the arithmetic coding technique is described. For appropriatevalues of n , k , and m, the scheme can be used to construct an (n,k)Mock code in which all the...
详细信息
A new scheme for the construction of m-out-of* codes
based on the arithmetic coding technique is described. For appropriate
values of n , k , and m, the scheme can be used to construct an (n,k)
Mock code in which all the codewords are of weight m. Such codes
are useful, for example, in providing perfect error detection capabil-
ity in asymmetric channels such as optical communication links and
laser disks. The encoding and decoding algorithms of the scheme per-
form simple arithmetic operations recursively, thereby facilitating the
construction of codes with relativelylong Mock sizes. The scheme also
allows the construction of optimal or naarly optimal m-out-of* codes
for a wide range of block sizes limited only by the arithmetic precision
used.
暂无评论