Scribd
Upload
6 views2 pages

SML2

The document discusses locally decodable codes and locally testable codes, which are error-correcting codes that allow decoding or testing of single bits without examining the entire codeword. It also discusses interleaving, which is a technique used to improve error correction by distributing errors across multiple codewords to prevent bursts from exceeding the error correction capacity.

Uploaded by

jafasoh293
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views2 pages

SML2

The document discusses locally decodable codes and locally testable codes, which are error-correcting codes that allow decoding or testing of single bits without examining the entire codeword. It also discusses interleaving, which is a technique used to improve error correction by distributing errors across multiple codewords to prevent bursts from exceeding the error correction capacity.

Uploaded by

jafasoh293
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Main articles: Locally decodable code and Locally testable code

Sometimes it is only necessary to decode single bits of the message, or to check whether a given signal is a codeword, and do
so without looking at the entire signal. This can make sense in a streaming setting, where codewords are too large to be classi-
cally decoded fast enough and where only a few bits of the message are of interest for now. Also such codes have become an
important tool in computational complexity theory, e.g., for the design of probabilistically checkable proofs.
Locally decodable codes are error-correcting codes for which single bits of the message can be probabilistically recovered by
only looking at a small (say constant) number of positions of a codeword, even after the codeword has been corrupted at some
constant fraction of positions. Locally testable codes are error-correcting codes for which it can be checked probabilistically
whether a signal is close to a codeword by only looking at a small number of positions of the signal.
Not all testing codes are locally decoding and testing of codes
Not all locally decodable codes (LDCs) are locally testable codes (LTCs)[15] neither locally correctable codes (LCCs),[16] q-query
LCCs are bounded exponentially[17][18] while LDCs can have subexponential lengths.[19][20]

Interleaving[edit]
"Interleaver" redirects here. For the fiber-optic device, see optical interleaver.

A short illustration of
interleaving idea
Interleaving is frequently used in digital communication and storage systems to improve the performance of forward error cor-
recting codes. Many communication channels are not memoryless: errors typically occur in bursts rather than independently. If
the number of errors within a code word exceeds the error-correcting code's capability, it fails to recover the original code word.
Interleaving alleviates this problem by shuffling source symbols across several code words, thereby creating a more uniform dis-
tribution of errors.[21] Therefore, interleaving is widely used for burst error-correction.
The analysis of modern iterated codes, like turbo codes and LDPC codes, typically assumes an independent distribution of er-
rors.[22] Systems using LDPC codes therefore typically employ additional interleaving across the symbols within a code word.[23]
For turbo codes, an interleaver is an integral component and its proper design is crucial for good performance.[21][24] The iterative
decoding algorithm works best when there are not short cycles in the factor graph that represents the decoder; the interleaver is
chosen to avoid short cycles.
Interleaver designs include:

 rectangular (or uniform) interleavers (similar to the method using skip factors described above)
 convolutional interleavers
 random interleavers (where the interleaver is a known random permutation)
 S-random interleaver (where the interleaver is a known random permutation with the constraint that no input symbols within
distance S appear within a distance of S in the output).[25]
 a contention-free quadratic permutation polynomial (QPP).[26] An example of use is in the 3GPP Long Term Evolution mo-
bile telecommunication standard.[27]
In multi-carrier communication systems, interleaving across carriers may be employed to provide frequency diversity, e.g., to
mitigate frequency-selective fading or narrowband interference.[28]

Example[edit]
Transmission without interleaving:
Error-free message: aaaabbbbccccddddeeeeffffgggg
Transmission with a burst error: aaaabbbbccc____deeeeffffgggg
Here, each group of the same letter represents a 4-bit one-bit error-correcting codeword. The codeword cccc is altered in one bit
and can be corrected, but the codeword dddd is altered in three bits, so either it cannot be decoded at all or it might be decoded
incorrectly.
With interleaving:
Error-free code words: aaaabbbbccccddddeeeeffffgggg
Interleaved: abcdefgabcdefgabcdefgabcdefg
Transmission with a burst error: abcdefgabcd____bcdefgabcdefg
Received code words after deinterleaving: aa_abbbbccccdddde_eef_ffg_gg
In each of the codewords "aaaa", "eeee", "ff

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy