This paper presents the first proof of polarization for the deletion channel with a constant
deletion rate and a regular hidden-Markov input distribution. A key part of this work involves …

The paper considers coding schemes derived from Reed-Muller (RM) codes, for
transmission over input-constrained memoryless channels. Our focus is on the-runlength …

To more efficiently realize the coded multiple-input multiple-output (MIMO) transmission and
improve the system performance, in this paper, we propose a framework combining the …

Fast polarization is crucial for the performance guarantees of polar codes. In the memoryless
setting, the rate of polarization is known to be exponential in the square root of the block …

In this paper, we apply polar codes to a modified version of OFDM systems with index
modulation which is called OFDM with in-phase/quadrature index modulation (OFDM-I/Q …

Introduction: In modern systems for communication, data storage and processing the error-
correction capability of codes are estimated for memoryless channels. In real channels the …

Over any discrete memoryless channel, we offer error correction codes such that: for one,
their block error probabilities and code rates scale like random codes'; and for two, their …

In this paper, we propose a polar coding scheme for binary deletion channels. We also
present an implementation of low-complexity polar SC decoder for deletion channels. The …

In this work, a novel data-driven methodology for designing polar codes for channels with
and without memory is proposed. The methodology is suitable for the case where the …

The problem of polar coding for an arbitrary sequence of independent binary-input
memoryless symmetric (BMS) channels {W i} i= 1 N is considered. Such a sequence of …