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

A rate R=5/20 hypergraph-based woven convolutional code with free distance 120

Publiceringsår: 2010
Språk: Engelska
Sidor: 1618-1623
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Volym: 56
Nummer: 4
Dokumenttyp: Artikel


A rate R=5/20 hypergraph-based woven convolu- tional code with overall constraint length 67 and constituent con- volutional codes is presented. It is based on a 3-partite, 3-uniform, 4-regular hypergraph and contains rate R=3/4 constituent convolutional codes with overall constraint length 5. Although the code construction is based on low-complexity codes, the free distance of this construction, computed with the BEAST algorithm, is dfree=120, which is remarkably large.



  • Electrical Engineering, Electronic Engineering, Information Engineering
  • hypergraphs
  • woven codes
  • tailbiting codes
  • graphs
  • convolutional codes
  • graph codes


  • Information Theory
Personal use of this material is permitted. However, permission to reprint or re-publish 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. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each authors copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
  • ISSN: 0018-9448

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