Analytical approach to low-density convolutional codes

Karin Engdahl, Michael Lentmaier, Dmitri Truhachev, Kamil Zigangirov

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review


A statistical analysis of low-density convolutional (LDC) codes is performed. This analysis is based on the consideration of a special statistical ensemble of Markov scramblers and the solution to a system of recurrent equations describing this ensemble. The results of the analysis are lower bounds for the free distance of the codes and upper bounds for the maximum likelihood decoding error probability. For the case where the size of the scrambler tends to infinity some asymptotic bounds for the free distance and the error probability are derived. Simulation results for iterative decoding of LDC codes are also presented.
Original languageEnglish
Title of host publication[Host publication title missing]
PublisherIEEE - Institute of Electrical and Electronics Engineers Inc.
ISBN (Print)0-7803-5857-0
Publication statusPublished - 2000
EventIEEE International Symposium on Information Theory (ISIT), 2000 - Sorrento, Sorrento, Italy
Duration: 2000 Jun 252000 Jun 30


ConferenceIEEE International Symposium on Information Theory (ISIT), 2000

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Free keywords

  • spatial coupling
  • LDPC codes
  • LDPC convolutional codes


Dive into the research topics of 'Analytical approach to low-density convolutional codes'. Together they form a unique fingerprint.

Cite this