• DocumentCode
    2389357
  • Title

    On the search for self-doubly orthogonal codes

  • Author

    Baechler, Brice ; Haccoun, David ; Gagnon, Franqois

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Ecole Polytech. de Montreal, Que., Canada
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    292
  • Abstract
    In this paper we present the search and determination of a subset of orthogonal convolutional codes called convolutional self doubly orthogonal codes (CSO2C). These codes may be advantageously utilised for the novel coding/iterative decoding technique introduced as an important amelioration of turbo codes. For this technique the code constraint length corresponds to the latency of each decoding iteration. Hence, an important parameter in the code searching is the minimisation of the code constraint length for a given error correcting capability
  • Keywords
    convolutional codes; error correction codes; iterative decoding; minimisation; search problems; turbo codes; CSO2C; code constraint length; code searching; convolutional self doubly orthogonal codes; decoding iteration; error correcting capability; iterative decoding; latency; minimisation; orthogonal convolutional codes; self-doubly orthogonal codes; turbo codes; Automatic testing; Convolutional codes; Delay; Electrical engineering; Error correction codes; Galois fields; Geometry; Iterative algorithms; Iterative decoding; Turbo codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2000. Proceedings. IEEE International Symposium on
  • Conference_Location
    Sorrento
  • Print_ISBN
    0-7803-5857-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2000.866590
  • Filename
    866590