Publication
On Codes Decoding a Constant Fraction of Errors on the BSC
Related publications (41)
Symmetry in design and decoding of polar-like codes
The beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...
EPFL2022Recursive Projection-Aggregation Decoding of Reed-Muller Codes
We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are lower-order RM code ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020On the Computational Complexity of Blind Detection of Binary Linear Codes
Alexios Konstantinos Balatsoukas Stimming, Aris Filos Ratsikas
In this work, we study the computational complexity of the Minimum Distance Code Detection problem. In this problem, we are given a set of noisy codeword observations and we wish to find a code in a set of linear codes C of a given dimension k, for which t ...
IEEE2019New Results On The Pseudoredundancy
The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding ...
2019Gaussian channel transmission of images and audio files using cryptcoding
Random codes based on quasigroups (RCBQ) are cryptcodes, i.e. they are error-correcting codes, which provide information security. Cut-Decoding and 4-Sets-Cut-Decoding algorithms for these codes are defined elsewhere. Also, the performance of these codes f ...
2019From LDPC Block to LDPC Convolutional Codes: Capacity, Stability, and Universality
In his landmark paper "A Mathematical Theory of Communication," the founding father of information theory and coding theory, Claude E. Shannon, established the largest rate at which reliable communication is possible and he revealed that the key to this re ...
EPFL2019Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels
Rüdiger Urbanke, Seyed Hamed Hassani, Shrinivas Kudekar, Yury Polyanskiy
Consider a binary linear code of length N, minimum distance d(min), transmission over the binary erasure channel with parameter 0 < epsilon < 1 or the binary symmetric channel with parameter 0 < epsilon < 1/2, and block-MAP decoding. It was shown by Tillic ...
IEEE2018Coding for Communications and Secrecy
Shannon, in his landmark 1948 paper, developed a framework for characterizing the fundamental limits of information transmission. Among other results, he showed that reliable communication over a channel is possible at any rate below its capacity. In 2008, ...
EPFL2017