English
Related papers

Related papers: On noisy duplication channels with Markov sources

200 papers

The fully quantum reverse Shannon theorem establishes the optimal rate of noiseless classical communication required for simulating the action of many instances of a noisy quantum channel on an arbitrary input state, while also allowing for…

Quantum Physics · Physics 2015-02-10 Manish K. Gupta , Mark M. Wilde

A system consisting of two parallel coupled channels where particles in one of them follow the rules of totally asymmetric exclusion processes (TASEP) and in another one move as in symmetric simple exclusion processes (SSEP) is investigated…

Statistical Mechanics · Physics 2009-11-13 K. Tsekouras , A. B. Kolomeisky

Information theory is introduced in this lecture note with a particular emphasis on its relevance to algebraic coding theory. The document develops the mathematical foundations for quantifying uncertainty and information transmission by…

Information Theory · Computer Science 2025-12-08 El Mahdi Mouloua , Essaid Mohamed

A noisy entropy inequality for boolean functions by Samorodnitsky is applied to binary codes. It is shown that a binary code that achieves capacity on the binary erasure channel admits optimal list size for list decoding on some binary…

Information Theory · Computer Science 2022-12-06 Jan Hązła

We demonstrate that the Maximum Lyapunov Exponent for computable dynamical systems is isomorphic to the maximum capacity of a noiseless, memoryless channel in a Shannon communication model. The isomorphism allows the understanding of…

Statistical Mechanics · Physics 2018-01-29 Gerald Friedland , Alfredo Metere

Using a stochastic generalization of the Hodgkin–Huxley model, we consider the influence of intrinsic channel noise on the synchronization between the spiking activity of the excitable membrane and an externally applied periodic…

Biological Physics · Physics 2007-05-23 Gerhard Schmid , Igor Goychuk , Peter Hanggi

This paper studies achievable rates of nanopore-based DNA storage when nanopore signals are decoded using a tractable channel model that does not rely on a basecalling algorithm. Specifically, the noisy nanopore channel (NNC) with the…

Information Theory · Computer Science 2025-08-13 Brendon McBain , Emanuele Viterbo

Recent advances in associative memory design through structured pattern sets and graph-based inference algorithms have allowed reliable learning and recall of an exponential number of patterns. Although these designs correct external errors…

Neural and Evolutionary Computing · Computer Science 2014-03-14 Amin Karbasi , Amir Hesam Salavati , Amin Shokrollahi , Lav R. Varshney

Noise induced hearing loss (NIHL) as one of major avoidable occupational related health issues has been studied for decades. To assess NIHL, the excitation pattern (EP) has been considered as one of mechanisms to estimate movements of…

Biological Physics · Physics 2017-06-01 Wisam Subhi Al-Dayyeni , Pengfei Sun , Jun Qin

The growing need for reliable communication over untrusted networks has caused a renewed interest in adversarial channel models, which often behave much differently than traditional stochastic channel models. Of particular practical use is…

Information Theory · Computer Science 2021-04-16 Vinayak Suresh , Eric Ruzomberka , David J. Love

A perturbative method is developed for calculating the effects of recurrent synaptic interactions between neurons embedded in a network. A series expansion is constructed that converges for networks with noisy membrane potential and weak…

Disordered Systems and Neural Networks · Physics 2009-11-10 Patrick D. Roberts

The Shannon capacity of a graph G is the maximum asymptotic rate at which messages can be sent with zero probability of error through a noisy channel with confusability graph G. This extensively studied graph parameter disregards the fact…

Quantum Physics · Physics 2014-03-05 Jop Briet , Harry Buhrman , Dion Gijswijt

Shannon's analysis of the fundamental capacity limits for memoryless communication channels has been refined over time. In this paper, the maximum volume $M_\avg^*(n,\epsilon)$ of length-$n$ codes subject to an average decoding error…

Information Theory · Computer Science 2016-12-28 Pierre Moulin

Shannon's entropy power inequality (EPI) can be viewed as a statement of concavity of an entropic function of a continuous random variable under a scaled addition rule: $$f(\sqrt{a}\,X + \sqrt{1-a}\,Y) \ge a f(X) + (1-a) f(Y) \quad \forall…

Quantum Physics · Physics 2016-06-06 Koenraad Audenaert , Nilanjana Datta , Maris Ozols

Growing interest in automatic speaker verification (ASV)systems has lead to significant quality improvement of spoofing attackson them. Many research works confirm that despite the low equal er-ror rate (EER) ASV systems are still…

Sound · Computer Science 2017-05-25 Galina Lavrentyeva , Sergey Novoselov , Konstantin Simonchik

This paper presents an analytical characterization of the ergodic capacity of amplify-and-forward (AF) MIMO dual-hop relay channels, assuming that the channel state information is available at the destination terminal only. In contrast to…

Information Theory · Computer Science 2016-11-17 Shi Jin , Matthew R. McKay , Caijun Zhong , Kai-Kit Wong

Accurate noise modelling is important for training of deep learning reconstruction algorithms. While noise models are well known for traditional imaging techniques, the noise distribution of a novel sensor may be difficult to determine a…

Machine Learning · Computer Science 2018-07-11 Felix Horger , Tobias Würfl , Vincent Christlein , Andreas Maier

We analyze the long-time behavior of numerical schemes for a class of monotone stochastic partial differential equations (SPDEs) driven by multiplicative noise. By deriving several time-independent a priori estimates for the numerical…

Numerical Analysis · Mathematics 2025-01-27 Zhihui Liu

This paper studies the basic question of whether a given channel $V$ can be dominated (in the precise sense of being more noisy) by a $q$-ary symmetric channel. The concept of "less noisy" relation between channels originated in network…

Information Theory · Computer Science 2018-12-04 Anuran Makur , Yury Polyanskiy

We derive new bounds on achievable precision in the most general adaptive quantum metrological scenarios. The bounds are proven to be asymptotically saturable and equivalent to the known parallel scheme bounds in the limit of large number…

‹ Prev 1 4 5 6 7 8 10 Next ›