Results 11 to 20 of about 31,167 (257)
Applied Sciences, 2022 According to an in-depth analysis of the relationship among n-level polybinary transformation, the time-packing factor and the performance of the decoding algorithm, we find that the appropriate n-level polybinary transformation can improve the ...
Peng Sun +3 more
doaj +1 more source
Algorithmic Obfuscation for LDPC Decoders
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2023 In order to protect intellectual property against untrusted foundry, many logic-locking schemes have been developed. The main idea of logic locking is to insert a key-controlled block into a circuit to make the circuit function incorrectly without right keys. However, in the case that the algorithm implemented by the circuit is naturally fault-tolerant
Jingbo Zhou 0002, Xinmiao Zhang 0001
openaire +2 more sources
On the Power of Relaxed Local Decoding Algorithms [PDF]
SIAM Journal on Computing, 2020 A locally decodable code (LDC) C : \{ 0, 1\} k \rightarrow \{ 0, 1\} n is an error correcting code wherein individual bits of the message can be recovered by only querying a few bits of a noisy codeword. LDCs found a myriad of applications both in theory and in practice, ranging from probabilistically checkable proofs to distributed storage.
Tom Gur, Oded Lachish
openaire +5 more sources
A latency‐reduced SC flip decoding algorithm for polar codes
IET Communications, 2022 The successive cancellation flip (SC Flip) decoding algorithm was recently suggested for decoding polar codes, which could improve the performance of the frame error rate (FER).
Dong Yang, Yinyou Mao, Xingcheng Liu
doaj +1 more source
A Low-latency Successive Cancellation List Decoding Algorithm for Polar Codes [PDF]
Jisuanji gongcheng, 2018 In order to further reduce the decoding delay,a low-latency adaptive Successive Cancellation List(SCL) decoding algorithm based on path reuse is proposed.A repeated path replicating scheme based on CRC check is adopted for the phenomenon that there is a ...
LIU Yajun,LI Shibao,LIU Jianhang,CHEN Haihua
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 +1 more source
A decoding algorithm for twisted Gabidulin codes [PDF]
2017 IEEE International Symposium on Information Theory (ISIT), 2017 This paper was submitted to ISIT ...
Joachim Rosenthal +1 more
openaire +3 more sources
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
List-Decoding Algorithms for Lifted Codes [PDF]
IEEE Transactions on Information Theory, 2016 15 pages, no figures.
Alan Guo, Swastik Kopparty
openaire +2 more sources
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