Pseudocodeword Performance Analysis for LDPC Convolutional Codes

DOI10.1109/TIT.2009.2018347MaRDI QIDQ4975880zbMATH OpenOpenAlexFDO

Authors Roxana Smarandache, Pascal O. Vontobel, Ali Emre Pusane, Daniel J. jun. Costello

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2009.2018347

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35)

Recommendations

• Low-density parity-check codes and the related performance analysis methods
• nd-convolutional codes. I. Performance analysis
• An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
• Iterative Decoding Threshold Analysis for LDPC Convolutional Codes
• Performance of LDPC Codes Under Faulty Iterative Decoding
• Searching for Binary and Nonbinary Block and Convolutional LDPC Codes
• LDPC code designs, constructions, and unification
• Characterizations of pseudo-codewords of (low-density) parity-check codes
• Finite Alphabet Iterative Decoders for LDPC Codes: Optimization, Architecture and Analysis
• Improved construction of LDPC convolutional codes with semi-random parity-check matrices

Cited in

(3)

• An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
• Performance analysis for cooperative communication system with QC-LDPC codes constructed with integer sequences
• A fast BER evaluation method for LDGM codes

This page was built for publication: Pseudocodeword Performance Analysis for LDPC Convolutional Codes

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