• DocumentCode
    2020132
  • Title

    Asymptotically Good Woven Codes with Fixed Constituent Convolutional Codes

  • Author

    Bocharova, I.E. ; Kudryashov, B.D. ; Johannesson, R. ; Zyablov, V.V.

  • Author_Institution
    St. Petersburg Univ. of Aerosp. Instrum., St. Petersburg
  • fYear
    2007
  • fDate
    24-29 June 2007
  • Firstpage
    2326
  • Lastpage
    2330
  • Abstract
    A construction of woven graph codes based on constituent convolutional codes is studied. It is shown that within the random ensemble of such codes there exist asymptotically good codes with short fixed constituent codes. An example of a rate R = 1/3 woven graph code with free distance equal to 32 based on rate Rc = 2/3 constituent convolutional codes with overall constraint length 5 is given.
  • Keywords
    convolutional codes; graph theory; parity check codes; LDPC codes; asymptotically good woven graph codes; fixed constituent convolutional codes; Binary codes; Block codes; Convolutional codes; Encoding; Information systems; Information technology; Iterative decoding; Linear code; Parity check codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2007. ISIT 2007. IEEE International Symposium on
  • Conference_Location
    Nice
  • Print_ISBN
    978-1-4244-1397-3
  • Type

    conf

  • DOI
    10.1109/ISIT.2007.4557169
  • Filename
    4557169
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2020132