
Polar Codes' Simplicity, Random Codes' Durability
Over any discrete memoryless channel, we build codes such that: for one,...
read it

Loglogarithmic Time Pruned Polar Coding on Binary Erasure Channels
A pruned variant of polar coding is reinvented for all binary erasure ch...
read it

The Error Probability of Sparse Superposition Codes with Approximate Message Passing Decoding
Sparse superposition codes, or sparse regression codes (SPARCs), are a r...
read it

Denoising as well as the best of any two denoisers
Given two arbitrary sequences of denoisers for block lengths tending to ...
read it

Polar Codes with exponentially small error at finite block length
We show that the entire class of polar codes (up to a natural necessary ...
read it

Variablelength Feedback Codes with Several Decoding Times for the Gaussian Channel
We investigate variablelength feedback (VLF) codes for the Gaussian poi...
read it

LDPC Codes with Local and Global Decoding
This paper presents a theoretical study of a new type of LDPC codes that...
read it
Complexity and Second Moment of the Mathematical Theory of Communication
The performance of an error correcting code is evaluated by its error probability, rate, and en/decoding complexity. The performance of a series of codes is evaluated by, as the block lengths approach infinity, whether their error probabilities decay to zero, whether their rates converge to capacity, and whether their growth in complexities stays under control. Over any discrete memoryless channel, I build codes such that: (1) their error probabilities and rates scale like random codes; and (2) their en/decoding complexities scale like polar codes. Quantitatively, for any constants p,r>0 s.t. p+2r<1, I construct a series of codes with block length N approaching infinity, error probability exp(N^p), rate N^r less than the capacity, and en/decoding complexity O(Nlog N) per block. Over any discrete memoryless channel, I also build codes such that: (1) they achieve capacity rapidly; and (2) their en/decoding complexities outperform all known codes over nonBEC channels. Quantitatively, for any constants t,r>0 s.t. 2r<1, I construct a series of codes with block length N approaching infinity, error probability exp((log N)^t), rate N^r less than the capacity, and en/decoding complexity O(Nlog(log N)) per block. The two aforementioned results are built upon two pillars: a versatile framework that generates codes on the basis of channel polarization, and a calculusprobability machinery that evaluates the performances of codes. The framework that generates codes and the machinery that evaluates codes can be extended to many other scenarios in network information theory. To name a few: lossless compression, lossy compression, SlepianWolf, WynerZiv, multiple access channel, wiretap channel, and broadcast channel. In each scenario, the adapted notions of error probability and rate approach their limits at the same paces as specified above.
READ FULL TEXT
Comments
There are no comments yet.