Related papers: Continuity of Channel Parameters and Operations un…
We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of…
The study is devoted to definition of generalized metrical and topological (informational entropy) characteristics of neural signals via their well-known theoretical models. We have shown that time dependence of action potential of neurons…
Dual scattering channel (DSC) schemes generalize Johns' TLM algorithm in replacing transmission lines with abstract scattering channels in terms of paired distributions. A well known merit of TLM schemes is unconditional stability, a…
This paper presents a statistical block fading channel model for multiuser massive MIMO system. The proposed channel model is evolved from correlation based stochastic channel model (CBSCM) but in addition to the properties of CBSCM, it has…
In this paper we establish some criteria to decide when a discrete memoryless channel admits a metric in such a way that the maximum likelihood decoding coincides with the nearest neighbour decoding. In particular we prove a conjecture…
Channels with synchronization errors, such as deletion and insertion errors, are crucial in DNA storage, data reconstruction, and other applications. These errors introduce memory to the channel, complicating its capacity analysis. This…
We present an analytic method of assessing the typical performance of low-density parity-check codes on finite-state Markov channels. We show that this problem is similar to a spin-glass model on a `small-world' lattice. We apply our…
The topology of a network associated with a reservoir computer is often taken so that the connectivity and the weights are chosen randomly. Optimization is hardly considered as the parameter space is typically too large. Here we investigate…
In the setting of a metric space equipped with a doubling measure supporting a Poincar\'e inequality, we show that BV functions are, in the sense of multiple limits, continuous with respect to a 1-fine topology, at almost every point with…
Exponential error bounds achievable by universal coding and decoding are derived for frame-asynchronous discrete memoryless %asynchronous multiple access channels with two senders, via the method of subtypes, a refinement of the method of…
We study connectivity preserving multivalued functions between digital images. This notion generalizes that of continuous multivalued functions studied mostly in the setting of the digital plane $Z^2$. We show that connectivity preserving…
Recently, the authors showed that Reed-Muller (RM) codes achieve capacity on binary memoryless symmetric (BMS) channels with respect to bit error rate. This paper extends that work by showing that RM codes defined on non-binary fields,…
This paper studies channel coding for the discrete memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. A multi-letter successive decoding rule depending on an arbitrary non-negative decoding metric is…
We show how to use properties of the quantum conditional mutual information to obtain continuity bounds for information characteristics of quantum channels depending on their input dimension. First we prove tight estimates for variation of…
While Learned Data Compression (LDC) has achieved superior compression ratios, balancing precise probability modeling with system efficiency remains challenging. Crucially, uniform single-stream architectures struggle to simultaneously…
We consider the redundancy of the exact channel synthesis problem under an i.i.d. assumption. Existing results provide an upper bound on the unnormalized redundancy that is logarithmic in the block length. We show, via an improved scheme,…
In this paper, we are concerned with the reliability assessment of redundant multi-channel systems having multiple controllers with overlapping functionality -- where all controllers are required to respond optimally to the non-faulty…
Continuous Time Markov Chain (CMTC) is widely used to describe and analyze systems in several knowledge areas. Steady state availability is one important analysis that can be made through Markov chain formalism that allows researchers…
We characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common randomness, (b) the input and state are subject to cost…
This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of…