Multiple error detection/correction using the Nordstrom-Robinson code
R. Klein, Murali R. Varanasi, Larry A. Dunning
Abstract
R. Klein, Murali R. Varanasi, Larry A. Dunning
Abstract
The non-linear Nordstrom-Robinson code of length 16 and minimum distance 6 has twice the codewords of any 16-bit linear code. The NR code is handled as though it were a linear code over Z/sub 4/ (the integers mod 4). Z/sub 4/ linearity is used here to evaluate the NR code itself along with the Hamming code and a (12, 8) used to detect 2-bit adjacent errors over 4-bit symbols.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The non-linear Nordstrom-Robinson code of length 16 and minimum distance 6 has twice the codewords of any 16-bit linear code. The NR code is handled as though it were a linear code over Z/sub 4/ (the integers mod 4). Z/sub 4/ linearity is used here to evaluate the NR code itself along with the Hamming code and a (12, 8) used to detect 2-bit adjacent errors over 4-bit symbols.
Key concepts: Constant-weight code, Code (set theory), Cyclic code, Hamming code, Dual code, Polynomial code, Linear code, Linearity