Results 61 to 70 of about 45,321 (190)

Bit-optimal decoding of codes whose Tanner graphs are trees

Discrete Applied Mathematics, 2003
A group algebra formulation for bit-optimal decoding of binary block codes is introduced. Using this new framework a simple algebraic proof is proposed that Pearl's and Gallager's belief propagation decoding algorithms are bit-optimal when the Tanner graph of the code is a tree.
Emina Soljanin, Elke Offer
openaire   +1 more source

Low-density parity-check codes based on sparse binary sequences

Tongxin xuebao, 2005
A novel and simple construction of regular LDPC codes was proposed, which used sparse binary sequences, through studying construction methods of LDPC codes.
HE Shan-bao, ZHAO Chun-ming, SHI Zhi-hua, JIANG Ming   +3 more
doaj   +2 more sources

Low-Complexity LDPC Decoding Algorithm Based on Layered Vicinal Variable Node Scheduling

Modelling and Simulation in Engineering, 2022
The informed dynamic scheduling (IDS) strategies for the low-density parity check (LDPC) decoding have shown superior performance in error correction and convergence speed, particularly those based on reliability measures and residual belief propagation (
Mhammed Benhayoun, Mouhcine Razi, Anas Mansouri, Ali Ahaitouf   +3 more
doaj   +1 more source

Characterizations of Pseudo-Codewords of LDPC Codes [PDF]

, 2005
An important property of high-performance, low complexity codes is the existence of highly efficient algorithms for their decoding. Many of the most efficient, recent graph-based algorithms, e.g.
Koetter, Ralf, Li, Wen-Ching W., Vontobel, Pascal O., Walker, Judy L.   +3 more
core   +5 more sources

Lowering the Error Floor of LDPC Codes Using Cyclic Liftings

, 2010
Cyclic liftings are proposed to lower the error floor of low-density parity-check (LDPC) codes. The liftings are designed to eliminate dominant trapping sets of the base code by removing the short cycles which form the trapping sets.
Ahmadian-Attari, Mahmoud, Asvadi, Reza, Banihashemi, Amir H.   +2 more
core   +1 more source

Hierarchical and High-Girth QC LDPC Codes

, 2011
We present a general approach to designing capacity-approaching high-girth low-density parity-check (LDPC) codes that are friendly to hardware implementation.
Draper, Stark C., Wang, Yige, Yedidia, Jonathan S.   +2 more
core   +2 more sources

Construction and Decoding of Quantum Margulis Codes [PDF]

Quantum
Quantum low-density parity-check codes are a promising approach to fault-tolerant quantum computation, offering potential advantages in rate and decoding efficiency.
Michele Pacenti, Dimitris Chytas, Bane Vasić   +2 more
doaj   +1 more source

Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes

IEEE Access, 2019
Belief-propagation (BP) algorithm and its variants are well-established methods for iterative decoding of LDPC codes. Among them, residual belief-propagation (RBP), which is the most primitive and representative informed dynamic scheduling (IDS) strategy,
Huilian Zhang, Shaoping Chen
doaj   +1 more source

On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles [PDF]

, 2017
Ali Dehghan, Amir H. Banihashemi
openalex   +2 more sources

Machine learning message-passing for the scalable decoding of QLDPC codes

npj Quantum Information
We present Astra, a novel and scalable decoder using graph neural networks. In general, Quantum Low Density Parity Check (QLDPC) decoding is based on Belief Propagation (BP, a variant of message-passing) and requires time intensive post-processing ...
Arshpreet Singh Maan, Alexandru Paler
doaj   +1 more source