Woven convolutional graph codes with large free distances
(2011) In Problems of Information Transmission 47(1). p.1-14- Abstract
- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1668478
- author
- Bocharova, Irina LU ; Hug, Florian LU ; Johannesson, Rolf LU and Kudryashov, Boris LU
- organization
- publishing date
- 2011
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- LDPC codes, hypergraphs, graph codes, graphs, Convolutional codes, girth, tailbiting codes, woven codes
- in
- Problems of Information Transmission
- volume
- 47
- issue
- 1
- pages
- 1 - 14
- publisher
- Springer
- external identifiers
-
- wos:000289689300001
- scopus:80051616915
- ISSN
- 0032-9460
- DOI
- 10.1134/S0032946011010017
- language
- English
- LU publication?
- yes
- id
- 8ce9f2d3-8924-442c-bb19-aa50feef2e33 (old id 1668478)
- date added to LUP
- 2016-04-01 13:31:46
- date last changed
- 2022-01-27 19:41:56
@article{8ce9f2d3-8924-442c-bb19-aa50feef2e33, abstract = {{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.}}, author = {{Bocharova, Irina and Hug, Florian and Johannesson, Rolf and Kudryashov, Boris}}, issn = {{0032-9460}}, keywords = {{LDPC codes; hypergraphs; graph codes; graphs; Convolutional codes; girth; tailbiting codes; woven codes}}, language = {{eng}}, number = {{1}}, pages = {{1--14}}, publisher = {{Springer}}, series = {{Problems of Information Transmission}}, title = {{Woven convolutional graph codes with large free distances}}, url = {{https://lup.lub.lu.se/search/files/3431730/1668483.pdf}}, doi = {{10.1134/S0032946011010017}}, volume = {{47}}, year = {{2011}}, }