On the theory of low-density convolutional codes. II

DOI10.1023/A:1013815115684MaRDI QIDQ1812388zbMATH OpenFDO

Authors M. Lentmaier, Dmitri V. Truhachev, Kamil S. Zigangirov

Publication date 8 September 2003

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

bounds on codeschannel modelslow-density convolutional codesasymptotic analysis and propertiesturbo-codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Channel models (including quantum) in information and communication theory (94A40) Convolutional codes (94B10) Error probability in coding theory (94B70)

Recommendations

• To the theory of low-density convolutional codes. I
• scientific article; zbMATH DE number 1504653
• Iterative decoding of binary block and convolutional codes
• Iterative decoding of LDPC codes: some bounds and properties
• Time-varying periodic convolutional codes with low-density parity-check matrix

Cited in

(10)

• Time-varying periodic convolutional codes with low-density parity-check matrix
• Log-likelihood ratio calculation for iterative decoding on Rayleigh fading channels using Padé approximation
• Asymptotic analysis of superorthogonal turbo codes
• scientific article; zbMATH DE number 1504653 (Why is no real title available?)
• On low complexity stack decoding of convolutional codes
• Analyzing the turbo decoder using the Gaussian approximation
• Chains of mean-field models
• An analysis of the block error probability performance of iterative decoding
• To the theory of low-density convolutional codes. I
• Constrained Information Combining: Theory and Applications for LDPC Coded Systems

This page was built for publication: On the theory of low-density convolutional codes. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812388)