Abstract
The standard product construction is discussed with respect to nonlinear codes. Thus, so-called nonlinear product codes are obtained that are better than linear product codes of similar length and code rate, and at the same time, amenable for encoding/decoding. On the other hand, it is shown that certain notorious nonlinear codes have an augmented product construction, namely, they can be constructed by taking the union of a product code and certain of its cosets. The binary Hamming codes are shown to have similar construction. A simple two-stage decoder is proposed for nonlinear product (NLP) codes. The decoder is shown to be a bounded-distance (BD) information decoder that is the nonlinear equivalent of the BD decoder employed for linear codes. A list-based maximum-likelihood decoder is also discussed.
| Original language | English |
|---|---|
| Pages (from-to) | 1845-1851 |
| Number of pages | 7 |
| Journal | IEEE Transactions on Communications |
| Volume | 55 |
| Issue number | 10 |
| DOIs | |
| State | Published - Oct 2007 |
Keywords
- Bounded-distance decoding
- Nonlinear codes
- Product codes
Fingerprint
Dive into the research topics of 'Nonlinear codes: The product construction'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver