相关论文: Extremality for Gallager's Reliability Function $E…
A unified framework to obtain all known lower bounds (random coding, typical random coding and expurgated bound) on the reliability function of a point-to-point discrete memoryless channel (DMC) is presented. By using a similar idea for a…
We survey coding techniques that enable reliable transmission at rates that approach the capacity of an arbitrary discrete memoryless channel. In particular, we take the point of view of modern coding theory and discuss how recent advances…
The mutual information of a discrete time memoryless Rayleigh fading channel is considered, where neither the transmitter nor the receiver has the knowledge of the channel state information except the fading statistics. We present the…
Complex eigenvalues of random matrices $J=\text{GUE }+ i\gamma \diag (1, 0, \ldots, 0)$ provide the simplest model for studying resonances in wave scattering from a quantum chaotic system via a single open channel. It is known that in the…
We investigate the duality of the binary erasure channel (BEC) and the binary defect channel (BDC). This duality holds for channel capacities, capacity achieving schemes, minimum distances, and upper bounds on the probability of failure to…
This study proposes \emph{modular arithmetic erasure channels} (MAECs), a novel class of erasure-like channels with an input alphabet that need not be binary. This class contains the binary erasure channel (BEC) and some other known…
In this paper, the sphere bound (SB) is revisited within a general bounding framework based on nested Gallager regions. The equivalence is revealed between the SB proposed by Herzberg and Poltyrev and the SB proposed by Kasami et al.,…
We find the exact upper estimate for the upper density of zeros of entire functions of exponential type whose indicator diagram is contained in a given interval.
In this paper, we study quasi-ergodicity for one-dimensional diffusion $X$ killed at 0, when 0 is an exit boundary and $+\infty$ is an entrance boundary. Using the spectral theory tool, we show that if the killed semigroup is intrinsically…
Variable-length block-coding schemes are investigated for discrete memoryless channels with ideal feedback under cost constraints. Upper and lower bounds are found for the minimum achievable probability of decoding error $P_{e,\min}$ as a…
The channel polarization behavior of polar codes under noise with memory is investigated. By introducing a genie-aided channel model, we first show that the polarized subchannels still converge to extremal channels under the standard polar…
Channels with synchronization errors, exhibiting deletion and insertion errors, find practical applications in DNA storage, data reconstruction, and various other domains. Presence of insertions and deletions render the channel with memory,…
We prove and discuss three results on zero distribution of gaussian analytic functions: (i) the Edeleman-Kostlan formula for the expectation of the counting measure; (ii) a variation on the theme of Calabi's rigidity theorem; (iii) Offord's…
In this paper we consider a discrete-time dynamical system on the real line by random iteration of two functions. These functions are assumed to satisfy appropriate monotonicity conditions; optionally, a symmetry condition may be imposed.…
A class of linear parabolic equations are considered. We give a posteriori error estimates in the maximum norm for a method that comprises extrapolation applied to the backward Euler method in time and finite element discretisations in…
This paper considers a binary channel with deletions and insertions, where each input bit is transformed in one of the following ways: it is deleted with probability d, or an extra bit is added after it with probability i, or it is…
Second-order coding rate of channel coding is discussed for general sequence of channels. The optimum second-order transmission rate with a constant error constraint $\epsilon$ is obtained by using the information spectrum method. We apply…
We consider a new formulation of a class of synchronization error channels and derive analytical bounds and numerical estimates for the capacity of these channels. For the binary channel with only deletions, we obtain an expression for the…
For a non-CM elliptic curve $E$ defined over $\mathbb{Q}$, the Galois action on its torsion points gives rise to a Galois representation $\rho_E: Gal(\overline{\mathbb{Q}}/\mathbb{Q})\to GL_2(\widehat{\mathbb{Z}})$ that is unique up to…
Using the magnetization enumerator method, we evaluate the practical and theoretical limitations of symmetric channels with real outputs. Results are presented for several regular Gallager code constructions.