Meny

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

Författare:
Publiceringsår: 2010
Språk: Engelska
Sidor: 1618-1623
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Volym: 56
Nummer: 4
Dokumenttyp: Artikel i tidskrift
Förlag: IEEE--Institute of Electrical and Electronics Engineers Inc.

Sammanfattning

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.

Nyckelord

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

Övriga

Published
  • Information Theory-lup-obsolete
  • ISSN: 0018-9448

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

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