On the girth of tanner (3, 5) quasi-cyclic LDPC codes
From MaRDI portal
Publication:3547150
DOI10.1109/TIT.2006.871060zbMATH Open1316.94127OpenAlexW2137401802MaRDI QIDQ3547150FDOQ3547150
Authors: SungHwan Kim, Jong-Seon No, Habong Chung, Dong-Joon Shin 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2006.871060
Recommendations
- scientific article; zbMATH DE number 6874357
- On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes
- On the girth of Tanner \((3, 7)\) quasi-cyclic LDPC codes
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
- Recursive construction of \((J,L)\) QC LDPC codes with girth 6
Cited In (5)
- On the girth of Tanner \((3, 7)\) quasi-cyclic LDPC codes
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
- Title not available (Why is that?)
- Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis
- On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes
This page was built for publication: On the girth of tanner (3, 5) quasi-cyclic LDPC codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547150)
