scholarly journals Pivoting Algorithms for Maximum Likelihood Decoding of LDPC Codes over Erasure Channels

2009 ◽  
Author(s):  
Gianluigi Liva ◽  
Balazs Matuz ◽  
Enrico Paolini ◽  
Marco Chiani
Keyword(s):  
Maximum Likelihood ◽  
Ldpc Codes ◽  
Maximum Likelihood Decoding ◽  
Erasure Channels

scholarly journals On maximum-likelihood decoding with circuit-level errors

Quantum ◽  
2020 ◽  
Vol 4 ◽  
pp. 304
Author(s):  
Leonid P. Pryadko
Keyword(s):  
Maximum Likelihood ◽  
Probability Distribution ◽  
Error Probability ◽  
Ldpc Codes ◽  
Quantum Codes ◽  
Quantum Code ◽  
Maximum Likelihood Decoding ◽  
Measurement Circuit ◽  
Equivalence Group ◽  
Error Probability Distribution

Error probability distribution associated with a given Clifford measurement circuit is described exactly in terms of the circuit error-equivalence group, or the circuit subsystem code previously introduced by Bacon, Flammia, Harrow, and Shi. This gives a prescription for maximum-likelihood decoding with a given measurement circuit. Marginal distributions for subsets of circuit errors are also analyzed; these generate a family of related asymmetric LDPC codes of varying degeneracy. More generally, such a family is associated with any quantum code. Implications for decoding highly-degenerate quantum codes are discussed.

2ℓ-Incorrigible set distributions of some linear codes by the finite geometry

2017 ◽  
Vol 09 (01) ◽  
pp. 1750012
Author(s):  
Lin-Zhi Shen ◽  
Fang-Wei Fu
Keyword(s):  
Maximum Likelihood ◽  
Linear Code ◽  
Error Probability ◽  
Linear Codes ◽  
Finite Geometry ◽  
Short Paper ◽  
List Decoding ◽  
Maximum Likelihood Decoding ◽  
Binary Linear Codes ◽  
Erasure Channels

The [Formula: see text]-incorrigible set distributions of binary linear codes over the erasure channels can be used to determine the decoding error probability of a linear code under maximum likelihood decoding and [Formula: see text]-list decoding. In this short paper, we give the [Formula: see text]-incorrigible set distributions of some linear codes by the finite geometry theory.

Enhanced Quasi-Maximum Likelihood Decoding Based on 2D Modified Min-Sum Algorithm for 5G LDPC Codes

2020 ◽  
Vol 68 (11) ◽  
pp. 6669-6682
Author(s):  
Peng Kang ◽  
Yixuan Xie ◽  
Lei Yang ◽  
Jinhong Yuan
Keyword(s):  
Maximum Likelihood ◽  
Ldpc Codes ◽  
Maximum Likelihood Decoding ◽  
Quasi Maximum Likelihood

Maximum likelihood decoding of RLL-FEC array codes on partial response channels

1993 ◽  
Vol 29 (16) ◽  
pp. 1406 ◽  
Author(s):  
G.S. Markarian ◽  
M. Naderi ◽  
B. Honary ◽  
A. Popplewell ◽  
J.J. O'Reilly
Keyword(s):  
Maximum Likelihood ◽  
Partial Response ◽  
Maximum Likelihood Decoding ◽  
Partial Response Channels ◽  
Array Codes
Sign in / Sign up

Export Citation Format

Share Document