Pages that link to "Item:Q3547029"

The following pages link to Regular and irregular progressive edge-growth tanner graphs (Q3547029):

Displaying 21 items.

• A class of quasi-cyclic LDPC codes from \(B_2\pmod m\) sequences (Q350929) (← links)
• Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth (Q543230) (← links)
• Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis (Q784385) (← links)
• Fundamental finite key limits for one-way information reconciliation in quantum key distribution (Q1702078) (← links)
• A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices (Q1752308) (← links)
• On the construction of stabilizer codes with an arbitrary binary matrix (Q1937244) (← links)
• A performance analysis of quantum low-density parity-check codes for correcting correlated errors (Q2024869) (← links)
• Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs (Q2078717) (← links)
• Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis (Q2229575) (← links)
• Multiple accumulated-crossover parallel concatenated SPC codes (Q2267131) (← links)
• Graph-based convolutional and block LDPC codes (Q2269366) (← links)
• Cospectral bipartite graphs with the same degree sequences but with different number of large cycles (Q2287757) (← links)
• Lowering the error floor of Gallager codes: a statistical-mechanical view (Q3301778) (← links)
• 4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTION (Q4956587) (← links)
• ON THE CLASS OF ARRAY-BASED APM-LDPC CODES (Q4956589) (← links)
• Counting short cycles of (c,d)-regular bipartite graphs (Q5013469) (← links)
• (Q5212442) (← links)
• Hardware design and implementation of high-speed multidimensional reconciliation sender module in continuous-variable quantum key distribution (Q6048735) (← links)
• A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems (Q6068539) (← links)
• Efficient information reconciliation in quantum key distribution systems using informed design of non-binary LDPC codes (Q6498726) (← links)
• Efficient information reconciliation for high-dimensional quantum key distribution (Q6550823) (← links)