Advanced

Mathematical analysis of iterative decoding of LDPC convolutional codes

Truhachev, Dmitri ; Lentmaier, Michael LU and Zigangirov, Kamil LU (2001) IEEE International Symposium on Information Theory (ISIT), 2001
Abstract
Asymptotic iterative decoding performance of low-density parity-check (LDPC) convolutional codes is analyzed. An important role within the analysis is a theorem on the minimal length of cycles in the Tanner graph describing a code
Please use this url to cite or link to this publication:
author
; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
host publication
[Host publication title missing]
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE International Symposium on Information Theory (ISIT), 2001
conference location
Washington, DC, United States
conference dates
2001-06-24 - 2001-06-29
external identifiers
  • scopus:0034865313
ISBN
0-7803-7123-2
DOI
10.1109/ISIT.2001.936054
language
English
LU publication?
yes
id
93e8f627-d580-49fe-a1e6-61372cefa649 (old id 3731543)
date added to LUP
2016-04-04 10:37:25
date last changed
2020-01-12 21:15:06
@inproceedings{93e8f627-d580-49fe-a1e6-61372cefa649,
  abstract     = {Asymptotic iterative decoding performance of low-density parity-check (LDPC) convolutional codes is analyzed. An important role within the analysis is a theorem on the minimal length of cycles in the Tanner graph describing a code},
  author       = {Truhachev, Dmitri and Lentmaier, Michael and Zigangirov, Kamil},
  booktitle    = {[Host publication title missing]},
  isbn         = {0-7803-7123-2},
  language     = {eng},
  publisher    = {IEEE - Institute of Electrical and Electronics Engineers Inc.},
  title        = {Mathematical analysis of iterative decoding of LDPC convolutional codes},
  url          = {http://dx.doi.org/10.1109/ISIT.2001.936054},
  doi          = {10.1109/ISIT.2001.936054},
  year         = {2001},
}