Results 61 to 70 of about 38,534 (221)

Entanglement-Assisted Quantum Quasi-Cyclic Low-Density Parity-Check Codes

, 2009
We investigate the construction of quantum low-density parity-check (LDPC) codes from classical quasi-cyclic (QC) LDPC codes with girth greater than or equal to 6.
Brun, Todd A., Devetak, Igor, Hsieh, Min-Hsiu   +2 more
core   +1 more source

Probabilistic Shaping for Asymmetric Channels and Low-Density Parity-Check Codes [PDF]

, 2023
Thomas Wiegart, Linfang Wang, Diego Lentner, Richard D. Wesel   +3 more
openalex   +1 more source

Multi-Dimensional Spatially-Coupled Codes

, 2013
Spatially-coupled (SC) codes are constructed by coupling many regular low-density parity-check codes in a chain. The decoding chain of SC codes stops when facing burst erasures. This problem can not be overcome by increasing coupling number.
Kasai, Kenta, Ohashi, Ryunosuke, Takeuchi, Keigo   +2 more
core   +1 more source

Error Exponents of Low-Density Parity-Check Codes on the Binary Erasure Channel

, 2006
We introduce a thermodynamic (large deviation) formalism for computing error exponents in error-correcting codes. Within this framework, we apply the heuristic cavity method from statistical mechanics to derive the average and typical error exponents of ...
Mora, Thierry, Rivoire, Olivier
core   +1 more source

Low-Density Parity-Check Codes as Stable Phases of Quantum Matter

PRX Quantum
Phases of matter with robust ground-state degeneracy, such as the quantum toric code, are known to be capable of robust quantum information storage. Here, we address the converse question: given a quantum error-correcting code, when does it define a ...
Chao Yin, Andrew Lucas
doaj   +1 more source

Protograph Based Low-Density Parity-Check Codes Design With Mixed Integer Linear Programming

IEEE Access, 2019
An approach to design protograph-based low-density parity-check (LDPC) codes utilizing mixed integer linear programming (MILP) optimization is presented in this paper.
Wojciech Sulek
doaj   +1 more source

Encoding of QC-LDPC Codes of Rank Deficient Parity Matrix

Journal of Engineering, 2016
the encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure.
Mohammed Kasim Mohammed Al-Haddad
doaj   +2 more sources

Derived dynamic scheduling for belief propagation decoding of LDPC codes

Electronics Letters
Among numerous dynamic scheduling strategies for low‐density parity‐check codes, many of them are of high complexity due to repetitive computation and ordering of belief residuals.
Xiaotian Xu, Hua Zhou, Jiayi Zhao
doaj   +1 more source

Reversible Low-Density Parity-Check Codes

IEEE Transactions on Information Theory, 2009
Low-density parity-check (LDPC) codes may be decoded using a circuit implementation of the sum-product algorithm which maps the factor graph of the code. By reusing the decoder for encoding, both tasks can be performed using the same circuit, thus reducing area and verification requirements.
David Haley, Alex Grant
openaire   +3 more sources

Effective distribution of codewords for Low Density Parity Check Cycle\n codes in the presence of disorder [PDF]

, 2019
Roshan Warman, Iuliana Teodorescu, Razvan Teodorescu   +2 more
openalex   +1 more source