Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Asymptotic performance of woven graph codes

  • Irina Bocharova
  • Boris Kudryashov
  • Rolf Johannesson
  • Victor Zyablov
Publiceringsår: 2008
Språk: Engelska
Sidor: 1025-1029
Dokumenttyp: Konferensbidrag


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.



  • Electrical Engineering, Electronic Engineering, Information Engineering


IEEE International Symposium on Information Theory
Toronto, Canada
  • Information Theory
"©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE."
  • ISBN: 978-1-4244-2256-2

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen