Regular and irregular progressive edge-growth tanner graphs

From MaRDI portal
Publication:3547029

DOI10.1109/TIT.2004.839541zbMath1304.05135MaRDI QIDQ3547029

No author found.

Publication date: 21 December 2008

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




Related Items (19)

Unnamed ItemA class of quasi-cyclic LDPC codes from \(B_2\pmod m\) sequencesHardware design and implementation of high-speed multidimensional reconciliation sender module in continuous-variable quantum key distributionA branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systemsOn the construction of stabilizer codes with an arbitrary binary matrixFundamental finite key limits for one-way information reconciliation in quantum key distributionDetecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysisLowering the error floor of Gallager codes: a statistical-mechanical viewA special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matricesLow complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growthMultiple accumulated-crossover parallel concatenated SPC codesGraph-based convolutional and block LDPC codesA performance analysis of quantum low-density parity-check codes for correcting correlated errorsCospectral bipartite graphs with the same degree sequences but with different number of large cyclesFlexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designsDetecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysisCounting short cycles of (c,d)-regular bipartite graphs4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTIONON THE CLASS OF ARRAY-BASED APM-LDPC CODES




This page was built for publication: Regular and irregular progressive edge-growth tanner graphs