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, Levenshtein, Delsarte-Goethals, Kerdock, and Nordstrom-Robinson codes. Being rectangular, each of these codes has a unique minimal trellis that can be used for soft-decision maximum-likelihood decoding.
| Original language | English |
|---|---|
| Pages (from-to) | 720-725 |
| Number of pages | 6 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 45 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1999 |
| Externally published | Yes |
Keywords
- Codes
- Delsarte-goethals
- Hadamard
- Kerdock
- Levenshtein
- Nonlinear
- Nordstrom-robinson
- Rectangular
- Trellis
Fingerprint
Dive into the research topics of 'On the rectangularity of nonlinear block codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver