Woven convolutional graph codes with large free distances

Irina Bocharova, Florian Hug, Rolf Johannesson, Boris Kudryashov

Research output: Contribution to journalArticlepeer-review

1 Citation (SciVal)
113 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)1-14
JournalProblems of Information Transmission
Volume47
Issue number1
DOIs
Publication statusPublished - 2011

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • LDPC codes
  • hypergraphs
  • graph codes
  • graphs
  • Convolutional codes
  • girth
  • tailbiting codes
  • woven codes

Fingerprint

Dive into the research topics of 'Woven convolutional graph codes with large free distances'. Together they form a unique fingerprint.

Cite this