Article

Woven convolutional graph codes with large free distances

Problems of Information Transmission (impact factor: 0.48). 04/2012; 47(1):1-14. DOI:10.1134/S0032946011010017 pp.1-14

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.

0 0
 · 
0 Bookmarks
 · 
18 Views
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Keywords

code rate
 
constituent convolutional codes
 
Costello lower
 
free distance
 
random ensemble
 
Simulation results
 
Viterbi decoding
 
woven graph codes
 

I.E. Bocharova