Results 21 to 30 of about 178,509 (285)
A minimax robust decoding algorithm
IEEE Transactions on Information Theory, 2000 We study the decoding problem in an uncertain noise environment. If the receiver knows the noise probability density function (PDF) at each time slot or its a priori probability, the standard Viterbi (1967) algorithm (VA) or the a posteriori probability (APP) algorithm can achieve optimal performance.
Wei, Lei +3 more
openaire +3 more sources
List Decoding Algorithm based on Voting in Groebner Bases for General One-Point AG Codes [PDF]
, 2016 We generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya Cab curves proposed by Lee, Bras-Amor\'os and O'Sullivan (2012) to general one-point AG codes, without any assumption. We also extend their unique decoding algorithm
Adams +55 more
core +3 more sources
A Reduced Latency List Decoding Algorithm for Polar Codes
, 2014 Long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm.
Lin, Jun, Xiong, Chenrong, Yan, Zhiyuan
core +1 more source
List-Decoding Algorithms for Lifted Codes [PDF]
IEEE Transactions on Information Theory, 2016 15 pages, no figures.
Guo, Alan, Kopparty, Swastik
openaire +2 more sources
Reduced Complexity Belief Propagation Decoders for Polar Codes
, 2015 Polar codes are newly discovered capacity-achieving codes, which have attracted lots of research efforts. Polar codes can be efficiently decoded by the low-complexity successive cancelation (SC) algorithm and the SC list (SCL) decoding algorithm.
Lin, Jun, Xiong, Chenrong, Yan, Zhiyuan
core +1 more source
Further results on independent Metropolis-Hastings-Klein sampling [PDF]
, 2016 Sampling from a lattice Gaussian distribution is emerging as an important problem in coding and cryptography. This paper gives a further analysis of the independent Metropolis-Hastings-Klein (MHK) algorithm we presented at ISIT 2015.
Ling, C, Wang, Z
core +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 +1 more source
Improved Recurrent Neural Network based BP Decoding Algorithm for Polar Codes
Guangtongxin yanjiu, 2022 In recent years, the emerging Deep Learning (DL) technology has made progress in the field of decoding. Current polar code neural network decoder has faster convergence speed and better Bit Error Rate (BER) performance than Belief Propagation (BP ...
Xue-lu DENG, Da-qin PENG
doaj +3 more sources
FDR coding and decoding algorithm for reliable transmission in underwater acoustic network
Tongxin xuebao, 2020 By analyzing the shortcomings of RLT coding and decoding algorithm,a filtering dimension reduction (FDR) algorithm was proposed,which eliminated the waiting time of the traditional decoding algorithm and achieves fast decoding.In addition,XOR operation ...
Lijuan WANG, Xiujuan DU, Chong LI
doaj +2 more sources
Research on multi-bit decoding algorithms for polar codes
Dianxin kexue, 2018 Aiming at the problem of high delay of successive cancellation lists (SCL) decoding algorithm for polar codes,a multi-bit SCL (MSCL) decoding algorithm based on log-likelihood ratio was proposed.The multiple codeword bits could be decoded simultaneously ...
Zhouqing SHEN, Junna SHANG
doaj +2 more sources