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 language | English |
|---|---|
| Pages (from-to) | 1-14 |
| Journal | Problems of Information Transmission |
| Volume | 47 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2011 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering
Free keywords
- LDPC codes
- hypergraphs
- graph codes
- graphs
- Convolutional codes
- girth
- tailbiting codes
- woven codes