Improved redundancy bounds for a class of previously constructed non- linear arithmetic multiple-error correcting codes are derived. These codes are.
On a Class of Nonlinear Arithmetic Codes that Are Easy to Decode � D. Mandelbaum � Published in Information and Control 1 February 1976 � Computer Science,�...
Multiple-error-correcting arithmetic codes which are nonlinear are constructed by residue encoding. A simple algorithm is given for correcting multiple�...
Missing: Easy | Show results with:Easy
AN encoding in residue number systems allows construction of a class of nonlinear arithmetic error-correcting codes. The properties of these codes are�...
Multiple-error-correcting arithmetic codes which are nonlinear are constructed by residue encoding. A simple algorithm is given for correcting multiple�...
Missing: Easy | Show results with:Easy
The codes constructed here are nonlinear and not cyclic, unlike some well-known arithmetic codes [5]. II. MULTIPLE-ERROR-CORRECTING CODES. The reader is�...
Missing: Easy | Show results with:Easy
decoding, arithmetic decoding and other techniques. ▻ 2 student projects in 2013/14 and strong student interest. ▻ Proxy for the study of non-linear codes�...
It is easy to show that the code is prefix-free. Thus, the decoding can proceed by using the standard techniques of constructing a prefix-tree and using the.
In this paper we construct two new families of nonlinear q-ary codes derived from the corresponding families of modified Butson Hadamard matrices.
Missing: Arithmetic | Show results with:Arithmetic
Oct 8, 1987 � The Preparata codes are a generalization of the Nordstrom-Robinson codes and are a class of nonlinear error-correcting codes of length 2".
Missing: Arithmetic | Show results with:Arithmetic