English
Related papers

Related papers: On noisy duplication channels with Markov sources

200 papers

Nanopore sequencing is an emerging DNA sequencing technology that has been proposed for use in DNA storage systems. We propose the noisy nanopore channel model for nanopore sequencing. This model captures duplications, inter-symbol…

Information Theory · Computer Science 2022-05-10 Brendon McBain , Emanuele Viterbo , James Saunderson

We propose a generalization of the asymptotic equipartition property to discrete sources with an ambiguous alphabet, and prove that it holds for irreducible stationary Markov sources with an arbitrary distinguishability relation. Our…

Information Theory · Computer Science 2022-07-29 Tamás Tasnádi , Péter Vrana

In this paper, we consider a recent channel model of a nanopore sequencer proposed by McBain, Viterbo, and Saunderson (2024), termed the noisy nanopore channel (NNC). In essence, an NNC is a duplication channel with structured, Markov…

Information Theory · Computer Science 2025-04-25 V. Arvind Rameshwar , Nir Weinberger

We study the classical problem of noisy constrained capacity in the case of the binary symmetric channel (BSC), namely, the capacity of a BSC whose inputs are sequences chosen from a constrained set. Motivated by a result of Ordentlich and…

Probability · Mathematics 2009-08-10 Guangyue Han , Brian Marcus

We present a development of parts of rate-distortion theory and pattern- matching algorithms for lossy data compression, centered around a lossy version of the Asymptotic Equipartition Property (AEP). This treatment closely parallels the…

Probability · Mathematics 2007-07-16 A. Dembo , I. Kontoyiannis

This paper was presented in poster form at and in the proceedings of the QCMC 2008. It is a summary of a fuller paper to appear separately. The classical product state capacity of a noisy quantum channel with memory is investigated. A…

Quantum Physics · Physics 2012-08-16 I. Akhalwaya , J. Wouters , M. Fannes , F. Petruccione

This article addresses the issue of the proof of the entropy power inequality (EPI), an important tool in the analysis of Gaussian channels of information transmission, proposed by Shannon. We analyse continuity properties of the mutual…

Information Theory · Computer Science 2013-04-04 Mark Kelbert , Yuri Suhov

We develop several lower bounds on the capacity of binary input symmetric output channels with synchronization errors which also suffer from other types of impairments such as substitutions, erasures, additive white Gaussian noise (AWGN)…

Information Theory · Computer Science 2012-03-30 Mojtaba Rahmati , Tolga M. Duman

Binary-input memoryless channels with a runlength constrained input are considered. Upper bounds to the capacity of such noisy runlength constrained channels are derived using the dual capacity method with Markov test distributions…

Information Theory · Computer Science 2016-11-17 Andrew Thangaraj

To model printing noise a binary noisy channel and a set of controlled gates are introduced. The channel input is an image created by a halftoning algorithm and its output is the printed picture. Using this channel robustness to noise…

Other Computer Science · Computer Science 2015-03-19 V. N. Gorbachev , E. S. Yakovleva

Regular perturbation is applied to the Manakov equation and motivates a generalized correlated phase-and-additive noise model for wavelength-division multiplexing over dual-polarization optical fiber channels. The model includes three…

Information Theory · Computer Science 2021-04-19 Francisco Javier Garcia-Gomez , Gerhard Kramer

The entropy of a binary symmetric Hidden Markov Process is calculated as an expansion in the noise parameter epsilon. We map the problem onto a one-dimensional Ising model in a large field of random signs and calculate the expansion…

Information Theory · Computer Science 2009-11-11 O. Zuk , I. Kanter , E. Domany

Given an independent and identically distributed source $X = \{X_i \}_{i=1}^{\infty}$ with finite Shannon entropy or differential entropy (as the case may be) $H(X)$, the non-asymptotic equipartition property (NEP) with respect to $H(X)$ is…

Information Theory · Computer Science 2012-04-18 En-Hui Yang , Jin Meng

Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained system is limited by the combinatorial capacity of the system…

Information Theory · Computer Science 2008-09-09 Georg Böcherer , Valdemar Cardoso da Rocha , Cecilio Pimentel

We derive an asymptotic log-Harnack inequality for nonlinear monotone SPDE driven by possibly degenerate multiplicative noise. Our main tool is the asymptotic coupling by the change of measure. As an application, we show that, under certain…

Probability · Mathematics 2024-09-19 Zhihui Liu

Consider a binary additive noise channel with noiseless feedback. When the noise is a stationary and ergodic process $\mathbf{Z}$, the capacity is $1-\mathbb{H}(\mathbf{Z})$ ($\mathbb{H}(\cdot)$ denoting the entropy rate). It is shown…

Information Theory · Computer Science 2012-06-01 Vinith Misra , Tsachy Weissman

Consider a stochastic nonlinear system controlled over a possibly noisy communication channel. An important problem is to characterize the largest class of channels for which there exist coding and control policies so that the closed-loop…

Optimization and Control · Mathematics 2021-02-11 Nicolas Garcia , Christoph Kawan , Serdar Yuksel

A class of burst noise-erasure channels which incorporate both errors and erasures during transmission is studied. The channel, whose output is explicitly expressed in terms of its input and a stationary ergodic noise-erasure process, is…

Information Theory · Computer Science 2017-05-05 Lin Song , Fady Alajaji , Tamás Linder

The entanglement-assisted classical capacity of a noisy quantum channel is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have…

Quantum Physics · Physics 2007-05-23 Charles H. Bennett , Peter W. Shor , John A. Smolin , Ashish V. Thapliyal

This paper first focuses on deriving an alternative approach for proving an extremal entropy inequality (EEI), originally presented in [11]. The proposed approach does not rely on the channel enhancement technique, and has the advantage…

Information Theory · Computer Science 2012-11-21 Sangwoo Park , Erchin Serpedin , Khalid Qaraqe
‹ Prev 1 2 3 10 Next ›