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

Authors:
Florian Hug;Irina E. Bocharova;Rolf Johannesson;Boris D. Kudryashov
Affiliations:
Department of Electrical and Information Technology, Lund University, Lund, Sweden;Department of Information Systems, St. Petersburg University of Information Technologies, Mechanics and Optics, St. Petersburg, Russia;Department of Electrical and Information Technology, Lund University, Lund, Sweden;Department of Information Systems, St. Petersburg University of Information Technologies, Mechanics and Optics, St. Petersburg, Russia
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 7
Cited 1

Fundamentals of Convolutional Coding

Fundamentals of Convolutional Coding
Woven graph codes: asymptotic performances and examples

IEEE Transactions on Information Theory
On the trellis structure of block codes

IEEE Transactions on Information Theory - Part 2
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding

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
Distance properties of expander codes

IEEE Transactions on Information Theory

Woven convolutional graph codes with large free distances

Problems of Information Transmission

Quantified Score

Hi-index	754.84

Visualization

Abstract

A rate R = 5/20 hypergraph-based woven convolutional code with overall constraint length 67 and constituent convolutional codes is presented. It is based on a 3-partite, 3-uniform, 4-regular hypergraph and contains rate Rc = 3/4 constituent convolutional codes with overall constraint length 5. Although the code construction is based on low-complexity codes, the free distance of this construction, computed with the BEAST algorithm, is dfree = 120, which is remarkably large.