On the rectangularity of nonlinear block codes

Vladimir Sidorenko, Lan Martin, Bahram Honary

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


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 languageEnglish
Pages (from-to)720-725
Number of pages6
JournalIEEE Transactions on Information Theory
Issue number2
Publication statusPublished - 1999
Externally publishedYes


  • Codes
  • Delsarte-goethals
  • Hadamard
  • Kerdock
  • Levenshtein
  • Nonlinear
  • Nordstrom-robinson
  • Rectangular
  • Trellis


Dive into the research topics of 'On the rectangularity of nonlinear block codes'. Together they form a unique fingerprint.

Cite this