The minimum Hamming distance of a linear block code is the smallest number of bit
changes required to transform one valid codeword into another. The code's minimum …

The performance of a code under the maximum-likelihood (ML) decoder highly depends on
the weight enumerating function (WEF). However, how to compute efficiently the WEF of a …

The number of minimum weight codewords, aka error coefficient, is a good comparative
measure for the block error rate (BLER) of a linear block code, in particular in a high SNR …

Noisy shuffling channels capture the main characteristics of DNA storage systems where
distinct segments of data are received out of order, after being corrupted by substitution …

Polarization-adjusted convolutional (PAC) codes of short blocklengths over the binary-input
additive white Gaussian noise channel have excellent performance. To further improve the …

Despite the extreme error-correction performance, the amount of computation of sequential
decoding of the polarization-adjusted convolutional (PAC) codes is random. In sequential …

Error-correcting codes for insertion and deletion (ID) errors have attracted considerable
attention because of their potential in future communication and storage systems. Existing …

We study the performance of sequential decoding of polarization-adjusted con-volutional
(PAC) codes. We present a metric function that employs bit-channel mutual information and …

Recently, a novel variation of polar codes known as polarization-adjusted convolutional
(PAC) codes has been introduced by Ar {\i} kan. These codes significantly outperform …

In this paper, we first introduce an efficient method for estimating weight distributions of polar
codes and polarization-adjusted convolutional (PAC) codes. Based on a recursive algorithm …