Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes

DOI10.1109/TIT.2012.2211995zbMATH Open1364.94647OpenAlexW2041324282MaRDI QIDQ2989458FDOQ2989458

Authors: David G. Mitchell, Ali Emre Pusane, Daniel J. jun. Costello 

Publication date: 8 June 2017

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

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

Mathematics Subject Classification ID

Convolutional codes (94B10)

Cited In (2)

• Asymptotically good convolutional codes
• Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers

This page was built for publication: Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes

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