Results 11 to 20 of about 2,460,873 (298)

Weighted BATS Codes with LDPC Precoding. [PDF]

open access: yesEntropy (Basel), 2023
Batched Sparse (BATS) codes are a type of network coding scheme that use a combination of random linear network coding (RLNC) and fountain coding to enhance the reliability and efficiency of data transmission. In order to achieve unequal error protection for different data, researchers have proposed unequal error protection BATS (UEP-BATS) codes ...
Zhang W, Zhu M.
europepmc   +4 more sources

On the Minimum Distance of Generalized LDPC Codes [PDF]

open access: green2007 IEEE International Symposium on Information Theory, 2007
We study necessary conditions which have to be satisfied in order to have LDPC codes with linear minimum distance. We give two conditions of this kind in this paper. These conditions are not met for several interesting code families: this shows that they are not asymptotically good.
Ayoub Otmani   +2 more
openalex   +6 more sources

Asymptotically good Quantum and locally testable classical LDPC codes [PDF]

open access: yesSymposium on the Theory of Computing, 2021
We study classical and quantum LDPC codes of constant rate obtained by the lifted product construction over non-abelian groups. We show that the obtained families of quantum LDPC codes are asymptotically good, which proves the qLDPC conjecture. Moreover,
Pavel Panteleev, G. Kalachev
semanticscholar   +1 more source

Good Quantum LDPC Codes with Linear Time Decoders [PDF]

open access: yesSymposium on the Theory of Computing, 2022
We construct a new explicit family of good quantum low-density parity-check codes which additionally have linear time decoders. Our codes are based on a three-term chain (2m× m)V   →δ0  (2m)E →δ1  2F where V (X-checks) are the vertices, E (qubits) are ...
Irit Dinur   +3 more
semanticscholar   +1 more source

4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTION [PDF]

open access: yesJournal of Algebraic Systems, 2021
Recently, a class of low-density parity-check codes based on affine permutation matrices, called APM-LDPC codes, have been considered which have some advantages than quasi-cyclic (QC) LDPC codes in terms of minimum-distance, cycle distribution, and error-
Z. Gholami, M. Gholami
doaj   +1 more source

Learning to Decode Protograph LDPC Codes [PDF]

open access: yesIEEE Journal on Selected Areas in Communications, 2021
The recent development of deep learning methods provides a new approach to optimize the belief propagation (BP) decoding of linear codes. However, the limitation of existing works is that the scale of neural networks increases rapidly with the codelength,
Jincheng Dai   +6 more
semanticscholar   +1 more source

Toward a Union-Find Decoder for Quantum LDPC Codes [PDF]

open access: yesIEEE Transactions on Information Theory, 2021
Quantum LDPC codes are a promising direction for low overhead quantum computing. In this paper, we propose a generalization of the Union-Find decoder as a decoder for quantum LDPC codes.
Nicolas Delfosse, V. Londe, M. Beverland
semanticscholar   +1 more source

Rate compatible reconciliation for continuous-variable quantum key distribution using Raptor-like LDPC codes [PDF]

open access: yesScience China Physics Mechanics and Astronomy, 2021
In the practical continuous-variable quantum key distribution (CV-QKD) system, the postprocessing process, particularly the error correction part, significantly impacts the system performance. Multi-edge type low-density parity-check (MET-LDPC) codes are
Chao Zhou   +5 more
semanticscholar   +1 more source

LDPC Codes with Soft Interference Cancellation for Uncoordinated Unsourced Multiple Access [PDF]

open access: yesICC 2021 - IEEE International Conference on Communications, 2021
This article presents a novel enhancement to the random spreading based coding scheme developed by Pradhan et al. for the unsourced multiple access channel.
A. K. Pradhan   +3 more
semanticscholar   +1 more source

Quantum LDPC Codes With Almost Linear Minimum Distance [PDF]

open access: yesIEEE Transactions on Information Theory, 2020
We give a construction of quantum LDPC codes of dimension $\Theta (\log N)$ and distance $\Theta (N/\log N)$ as the code length $N\to \infty $ . Using a product of chain complexes this construction also provides a family of quantum LDPC codes of ...
Pavel Panteleev, G. Kalachev
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy