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 Item ⋮ A class of quasi-cyclic LDPC codes from \(B_2\pmod m\) sequences ⋮ Hardware design and implementation of high-speed multidimensional reconciliation sender module in continuous-variable quantum key distribution ⋮ A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems ⋮ On the construction of stabilizer codes with an arbitrary binary matrix ⋮ Fundamental finite key limits for one-way information reconciliation in quantum key distribution ⋮ Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis ⋮ Lowering the error floor of Gallager codes: a statistical-mechanical view ⋮ A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices ⋮ Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth ⋮ Multiple accumulated-crossover parallel concatenated SPC codes ⋮ Graph-based convolutional and block LDPC codes ⋮ A performance analysis of quantum low-density parity-check codes for correcting correlated errors ⋮ Cospectral bipartite graphs with the same degree sequences but with different number of large cycles ⋮ Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs ⋮ Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis ⋮ Counting short cycles of (c,d)-regular bipartite graphs ⋮ 4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTION ⋮ ON THE CLASS OF ARRAY-BASED APM-LDPC CODES
This page was built for publication: Regular and irregular progressive edge-growth tanner graphs
