This article is focused on the performance evaluation of linear codes under optimal
maximum-likelihood (ML) decoding. Though the ML decoding algorithm is prohibitively …

Noise is an inalienable property of all communication systems appearing in nature. Such
noise acts against the very purpose of communication, that is delivery of a data to the …

This paper shows that, for discrete memoryless channels, the error exponent of a randomly
generated code with independent codewords converges in probability to its expectation …

We propose a two-dimensional modified min-sum algorithm for the LDPC codes in the fifth
generation (5G) networks standard to approach the error performance of the sum-product …

In this paper, we propose a class of codes, referred to as random staircase generator matrix
codes (SGMCs), which have staircase-like generator matrices. In the infinite-length region …

We study application of convolutional codes to the randomized encoding scheme introduced
by Wyner as a way of confusing the eavesdropper over a wiretap channel. We describe …

We address the problem of bounding below the probability of error under maximum-
likelihood decoding of a binary code with a known distance distribution used on a binary …

In this paper, we propose systematic block Markov superposition transmission of repetition
(BMST-R) codes, which can support a wide range of code rates but maintain essentially the …

This paper establishes information-theoretic limits for estimating a finite-field low-rank matrix
given random linear measurements of it. These linear measurements are obtained by taking …

New lower bounds on the error probability of block codes with maximum-likelihood
decoding are proposed. The bounds are obtained by applying a new lower bound on the …