Results 21 to 30 of about 1,678,536 (296)
Polar Codes based on Bit Flipping Improved BP Decoding Algorithm
Guangtongxin yanjiu, 2021 Polar codes is the only coding scheme in the world that has been proved that the Shannon threshold is reachable. Because of the high time delay caused by the serial characteristic of Successive Cancellation (SC) decoding, the Belief Propagation (BP ...
Hua-hua WANG +4 more
doaj +1 more source
ACM SIGACT News, 2000 Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged between the two topics in the recent years. This connection is centered around the notion of “list-decoding” for error-correcting codes. In this survey we describe the list-decoding
openaire +3 more sources
Graph-Based Codes and Iterative Decoding [PDF]
, 2003 The field of error correcting codes was revolutionized by the introduction of turbo codes in 1993. These codes demonstrated dramatic performance improvements over any previously known codes, with significantly lower complexity.
Khandekar, Aamod Dinkar
core +1 more source
Simple algorithms for BCH decoding [PDF]
IEEE Transactions on Communications, 1995 Summary: Some simple algorithms for decoding BCH codes are proposed. We show that the pruned FFT is an effective method for evaluating syndromes and for finding the roots of error-locator polynomials. We show that a simple variation of the basic Gaussian elimination procedure can be adapted to compute the error-locator polynomial efficiently for codes ...
Jonathan Hong, Martin Vetterli
openaire +3 more sources
A Decoding Algorithm for LDPC Codes Over Erasure Channels with Sporadic Errors [PDF]
, 2010 An efficient decoding algorithm for low-density parity-check (LDPC) codes on erasure channels with sporadic errors (i.e., binary error-and-erasure channels with error probability much smaller than the erasure probability) is proposed and its performance ...
Paolini, Enrico +9 more
core +1 more source
Further investigation on adaptive search
The Journal of Engineering, 2014 Adaptive search is one of the fastest fractal compression algorithms and has gained great success in many industrial applications. By substituting the luminance offset by the range block mean, the authors create a completely new version for both the ...
Ming Hong Pi +4 more
doaj +1 more source
fMRI Brain Decoding and Its Applications in Brain–Computer Interface: A Survey
Brain Sciences, 2022 Brain neural activity decoding is an important branch of neuroscience research and a key technology for the brain–computer interface (BCI). Researchers initially developed simple linear models and machine learning algorithms to classify and recognize ...
Bing Du +3 more
doaj +1 more source
Erasure codes with a banded structure for hybrid iterative-ML decoding [PDF]
, 2009 This paper presents new FEC codes for the erasure channel, LDPC-Band, that have been designed so as to optimize a hybrid iterative-Maximum Likelihood (ML) decoding.
Soro, Alexandre +7 more
core +1 more source
Deep Neural Network Based Reconciliation for CV-QKD
Photonics, 2022 High-speed reconciliation is indispensable for supporting the continuous-variable quantum key distribution (CV-QKD) system to generate the secure key in real-time. However, the error correction process’s high complexity and low processing speed limit the
Jun Xie +3 more
doaj +1 more source
Semi-blind iterative joint channel estimation and K-best sphere decoding for MIMO
, 2013 An efficient and high-performance semi-blind scheme is proposed for Multiple-Input Multiple-Output (MIMO) systems by iteratively combining channel estimation with K-Best Sphere Decoding (SD).
Messier, G.G. +3 more
core +2 more sources