Results 11 to 20 of about 1,331 (215)
Logarithmic time encoding and decoding of integer error control codes
One of the most important characteristics of all error control codes (ECCs) is the complexity of the encoding/decoding algorithms. Today, there are many ECCs that can correct multiple bit errors, but at the price of high encoding/decoding complexity ...
Aleksandar Radonjic, Vladimir Vujicic
doaj +1 more source
Multi-Filter Decoding in WiFi Backscatter Communication
WiFi backscatter communication has emerged as a promising enabler of ultralow-power connectivity for Internet of things, wireless sensor network and smart energy.
Richard Boateng Nti, Ji-Hoon Yun
doaj +1 more source
A Hypergraph Filtering Based Iterative Decoding Approach for Linear Channel Codes
Efficient decoding for general linear channel codes has been a long standing problem. Message passing type algorithms can achieve near-optimal performance for channel codes with sparse check matrices and long code-lengths, but they may suffer from ...
Jiaqi He +4 more
doaj +1 more source
Simple algorithms for BCH decoding [PDF]
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 +2 more sources
Algorithmic Obfuscation for LDPC Decoders
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
We propose generalized partially information coupled (PIC) polar codes and their construction method. In the proposed codes, each code block (CB) shares systematic information bits partially with J adjacent CBs on each side, where J is referred to as the
Hyoungbae Ahn +2 more
doaj +1 more source
On the Power of Relaxed Local Decoding Algorithms [PDF]
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
Polar Codes based on Bit Flipping Improved BP Decoding Algorithm
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
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
Further investigation on adaptive search
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

