On the rectangularity of nonlinear block codes

Authors
Sidorenko, V Martin, I Honary, B
Citation
V. Sidorenko et al., On the rectangularity of nonlinear block codes, IEEE INFO T, 45(2), 1999, pp. 720-725
Citations number
27
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE TRANSACTIONS ON INFORMATION THEORY
ISSN journal
00189448 → ACNP
Volume
45
Issue
2
Year of publication
1999
Pages
720 - 725
Database
ISI
SICI code
0018-9448(199903)45:2<720:OTRONB>2.0.ZU;2-P
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 in clude Hadamard, Levenshtein, Delsarte-Goethals, Kerdock, and Nordstrom-Robi nson codes. Being rectangular, each of these codes has a unique minimal tre llis that can he used for soft-decision maximum-likelihood decoding.