|
Problemy Peredachi Informatsii, 2011, Volume 47, Issue 1, Pages 3–18
(Mi ppi2033)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Coding Theory
Woven convolutional graph codes with large free distances
I. E. Bocharovaa, F. Hugb, R. Johannessonb, B. D. Kudryashova a St. Petersburg State University of Information Technologies, Mechanics and Optics (ITMO)
b Lund University, Sweden
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.
Received: 05.05.2010 Revised: 19.10.2010
Citation:
I. E. Bocharova, F. Hug, R. Johannesson, B. D. Kudryashov, “Woven convolutional graph codes with large free distances”, Probl. Peredachi Inf., 47:1 (2011), 3–18; Problems Inform. Transmission, 47:1 (2011), 1–14
Linking options:
https://www.mathnet.ru/eng/ppi2033 https://www.mathnet.ru/eng/ppi/v47/i1/p3
|
Statistics & downloads: |
Abstract page: | 884 | Full-text PDF : | 103 | References: | 42 | First page: | 15 |
|