Woven convolutional graph codes with large free distances

Summary, in English

Constructions of woven graph codes based on constituent convolutional codes are studied and examples of woven convolutional graph codes are presented. The existence of codes, satisfying the Costello lower bound on the free distance, within the random ensemble of woven graph codes based on s-partite, s-uniform hypergraphs, where s depends only on the code rate, is shown. Simulation results for Viterbi decoding of woven graph codes are presented and discussed.

• Författare: Irina Bocharova; Florian Hug; Rolf Johannesson; Boris Kudryashov
• Avdelning/ar: Institutionen för elektro- och informationsteknik
• Publiceringsår: 2011
• Språk: Engelska
• Sidor: 1-14
• Publikation/Tidskrift/Serie: Problems of Information Transmission
• Volym: 47
• Issue: 1
• Fulltext: - 455 kB; Download statistics
• Länkar: http://dx.doi.org/10.1134/S0032946011010017
• Dokumenttyp: Artikel i tidskrift
• Förlag: Springer
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Nyckelord: LDPC codes; hypergraphs; graph codes; graphs; Convolutional codes; girth; tailbiting codes; woven codes
• Status: Published
• Forskningsgrupp: Information Theory
• ISBN/ISSN/Övrigt: ISSN: 0032-9460