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

Woven convolutional graph codes with large free distances

Publiceringsår: 2011
Språk: Engelska
Sidor: 1-14
Publikation/Tidskrift/Serie: Problems of Information Transmission
Volym: 47
Nummer: 1
Dokumenttyp: Artikel
Förlag: Springer

Sammanfattning

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.

Disputation

Nyckelord

  • Technology and Engineering
  • LDPC codes
  • hypergraphs
  • graph codes
  • graphs
  • Convolutional codes
  • girth
  • tailbiting codes
  • woven codes

Övriga

Published
Yes
  • Information Theory
  • ISSN: 0032-9460

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