Woven convolutional graph codes with large free distances
| Autor: | Irina E. Bocharova, Rolf Johannesson, Florian Hug, Boris D. Kudryashov |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
graphs
Block code Discrete mathematics graph codes LDPC codes Computer Networks and Communications Concatenated error correction code Convolutional codes tailbiting codes woven codes Serial concatenated convolutional codes Sequential decoding Electrical Engineering Electronic Engineering Information Engineering Linear code Expander code Computer Science Applications girth Combinatorics hypergraphs Convolutional code Turbo code MathematicsofComputing_DISCRETEMATHEMATICS Information Systems Mathematics |
| Zdroj: | Problems of Information Transmission; 47(1), pp 1-14 (2011) |
| ISSN: | 1608-3253 0032-9460 |
| DOI: | 10.1134/s0032946011010017 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink