Woven convolutional graph codes with large free distances

Authors:
I. E. Bocharova;F. Hug;R. Johannesson;B. D. Kudryashov
Affiliations:
St. Petersburg State University of Information Technologies, Mechanics and Optics (ITMO), St. Petersburg, Russia;Lund University, Lund, Sweden;Lund University, Lund, Sweden;St. Petersburg State University of Information Technologies, Mechanics and Optics (ITMO), St. Petersburg, Russia
Venue:
Problems of Information Transmission
Year:
2011

Citing 7
Cited 0

Fundamentals of Convolutional Coding

Fundamentals of Convolutional Coding
Graphs and Hypergraphs

Graphs and Hypergraphs
Graph-based convolutional and block LDPC codes

Problems of Information Transmission
A rate R = 5/20 hypergraph-based woven convolutional code with free distance 120

IEEE Transactions on Information Theory
Woven graph codes: asymptotic performances and examples

IEEE Transactions on Information Theory
Woven convolutional codes .I. Encoder properties

IEEE Transactions on Information Theory
A BEAST for prowling in trees

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constructions of woven graph codes based on constituent convolutional codes are studied, and examples of woven convolutional graph codes are presented. Existence of codes satisfying the Costello lower bound on the free distance within a random ensemble of woven graph codes based on s-partite, s-uniform hypergraphs is shown, where s depends only on the code rate. Simulation results for Viterbi decoding of woven graph codes are presented and discussed.