On the rectangularity of nonlinear block codes

Authors:
V. Sidorenko;I. Martin;B. Honsry
Affiliations:
Inst. of Problems of Inf. Transmission, Acad. of Sci., Moscow;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 2

Ordered Binary Decision Diagrams and Minimal Trellises

IEEE Transactions on Computers
Rectangular Codes and Rectangular Algebra

AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Quantified Score

Hi-index	754.84

Visualization

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