Maximum-likelihood decoding of array codes with trellis structure

1993 ◽  
Vol 140 (5) ◽  
pp. 340 ◽  
Author(s):  
B. Honary ◽  
L. Kaya ◽  
G.S. Markarian ◽  
M. Darnell
1993 ◽  
Vol 29 (16) ◽  
pp. 1406 ◽  
Author(s):  
G.S. Markarian ◽  
M. Naderi ◽  
B. Honary ◽  
A. Popplewell ◽  
J.J. O'Reilly

1999 ◽  
Vol 09 (05n06) ◽  
pp. 307-319 ◽  
Author(s):  
K. M. S. SOYJAUDAH ◽  
M. I. JAHMEERBACUS

Previously, the proposed embedded coding techniques based on the row and column array codes, employ a combination of inner codes for error correction and outer codes for error detection. The outer codes involve the addition of further redundant bits. This reduces the overall code rate and hence, the throughput of the system. Furthermore, the decoding of these array codes is not a maximum likelihood decoding. In this paper, we propose a novel embedded coding technique that employs a combination of row and column array codes as well as the generalized array codes, but no outer code. The decoding of these codes is a maximum likelihood decoding and the error detection is done by a new statistical channel evaluation technique that uses the trellises of the component codes embedded in the main block.


Quantum ◽  
2020 ◽  
Vol 4 ◽  
pp. 304
Author(s):  
Leonid P. Pryadko

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.


Sign in / Sign up

Export Citation Format

Share Document