Title :
On the rectangularity of nonlinear block codes
Author :
Sidorenko, Vladimir ; Martin, Ian ; Honsry, B.
Author_Institution :
Inst. of Problems of Inf. Transmission, Acad. of Sci., Moscow, Russia
fDate :
3/1/1999 12:00:00 AM
Abstract :
We give simple sufficient conditions for a code to be rectangular and show that large families of well-known nonlinear codes are rectangular. These include Hadamard (1893), Levenshtein (1964), Delsarte-Goethals (1975), Kerdock (1972), and Nordstrom-Robinson (1967) codes. Being rectangular, each of these codes has a unique minimal trellis that can be used for soft-decision maximum-likelihood decoding
Keywords :
Hadamard codes; Viterbi decoding; binary codes; block codes; maximum likelihood decoding; nonlinear codes; Delsarte-Goethals codes; Hadamard codes; Kerdock codes; Levenshtein codes; Nordstrom-Robinson codes; Viterbi decoding; binary codes; conference matrix codes; minimal trellis; nonlinear block codes; rectangular codes; soft-decision maximum-likelihood decoding; sufficient conditions; Block codes; Design methodology; Error correction; Error correction codes; Linear code; Linearity; Maximum likelihood decoding; Notice of Violation; Sufficient conditions; Viterbi algorithm;
Journal_Title :
Information Theory, IEEE Transactions on
