• DocumentCode
    934662
  • Title

    Nonlinear Codes: The Product Construction

  • Author

    Amrani, Ofer

  • Author_Institution
    Tel-Aviv Univ., Tel-Aviv
  • Volume
    55
  • Issue
    10
  • fYear
    2007
  • Firstpage
    1845
  • Lastpage
    1851
  • 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.
  • Keywords
    Hamming codes; binary codes; maximum likelihood decoding; nonlinear codes; product codes; augmented product construction; binary Hamming codes; bounded-distance information decoder; decoding; encoding; linear product codes; list-based maximum-likelihood decoder; nonlinear product codes; Chromium; Code standards; Communications Society; Encoding; Error correction codes; Iterative decoding; Linear code; Maximum likelihood decoding; Multidimensional systems; Product codes; Bounded-distance decoding; nonlinear codes; product codes;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOMM.2007.906365
  • Filename
    4352081