Asymptotic performance of woven graph codes

Summary, in English

Constructions of woven graph codes based on constituent block and convolutional codes are studied. It is shown that within the random ensemble of such codes based on s-partite, s-uniform hypergraphs, where s depends only on the code rate, there exist codes satisying the Varshamov-Gilbert (VG) and the Costello lower bound on the minimum distance and the free distance, respectively.

• Författare: Irina Bocharova; Boris Kudryashov; Rolf Johannesson; Victor Zyablov
• Avdelning/ar: Institutionen för elektro- och informationsteknik
• Publiceringsår: 2008
• Språk: Engelska
• Sidor: 1025-1029
• Publikation/Tidskrift/Serie: [Host publication title missing]
• Fulltext: - 286 kB; Download statistics
• Länkar: http://dx.doi.org/10.1109/ISIT.2008.4595142
• Dokumenttyp: Konferensbidrag
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Conference name: IEEE International Symposium on Information Theory, 2008
• Conference date: 2008-07-06 - 2008-07-11
• Conference place: Toronto, Canada
• Status: Published
• Forskningsgrupp: Information Theory
• ISBN/ISSN/Övrigt: ISBN: 978-1-4244-2256-2