English
Related papers

Related papers: Variable-Length Coding of Two-Sided Asymptotically…

200 papers

In this paper we study the nonasymptotic bounds of a special Joint Source-Channel Coding system with hierarchical source, where an observable source and an unobservable indirect source are required to be reconstructed. Namely, we focus on…

Information Theory · Computer Science 2026-03-17 Shuo Shao , Chao Qi , Jincheng Dai

In this article we establish two fundamental results for the sublevel set persistent homology for stationary processes indexed by the positive integers. The first is a strong law of large numbers for the persistence diagram (treated as a…

Probability · Mathematics 2025-08-22 Andrew M. Thomas

This paper studies properties of binary runlength-limited sequences with additional constraints on their Hamming weight and/or their number of runs of identical symbols. An algebraic and a probabilistic (entropic) characterization of the…

Information Theory · Computer Science 2022-02-21 Mladen Kovačević , Dejan Vukobratović

Bi-modal (respectively, multi-modal) constrained coding refers to an encoding model whereby a user input block can be mapped to two (respectively, multiple) codewords. In current storage applications, such as optical disks, multi-modal…

Information Theory · Computer Science 2020-04-30 Ron M. Roth , Paul H. Siegel

Previous work by the authors on parity-preserving fixed-length constrained encoders is extended to the variable-length case. Parity-preserving variable-length encoders are formally defined, and, to this end, Kraft conditions are developed…

Information Theory · Computer Science 2021-07-05 Ron M. Roth , Paul H. Siegel

This paper addresses the topic of robust Bayesian compressed sensing over finite fields. For stationary and ergodic sources, it provides asymptotic (with the size of the vector to estimate) necessary and sufficient conditions on the number…

Information Theory · Computer Science 2014-01-20 Wenjie Li , Francesca Bassi , Michel Kieffer

Asymptotic expansions with explicit upper bounds for remainders are given for stationary distributions of nonlinearly perturbed semi-Markov processes with finite phase spaces. The corresponding algorithms are based on a special technique of…

Probability · Mathematics 2016-03-16 Dmitrii Silvestrov , Sergei Silvestrov

This study investigates the fundamental limits of variable-length compression in which prefix-free constraints are not imposed (i.e., one-to-one codes are studied) and non-vanishing error probabilities are permitted. Due in part to a…

Information Theory · Computer Science 2021-10-05 Yuta Sakai , Recep Can Yavas , Vincent Y. F. Tan

A variety of physical phenomena involve the nonlinear transfer of energy from weakly damped modes subjected to external forcing to other modes which are more heavily damped. In this work we explore this in (finite-dimensional) stochastic…

Probability · Mathematics 2022-06-07 Jacob Bedrossian , Kyle Liss

We study nonlinear energy transfer and the existence of stationary measures in a class of degenerately forced SDEs on $\mathbb R^d$ with a quadratic, conservative nonlinearity $B(x,x)$ constrained to possess various properties common to…

Probability · Mathematics 2024-07-24 Jacob Bedrossian , Alex Blumenthal , Keagan Callis , Kyle Liss

We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…

Functional Analysis · Mathematics 2026-04-15 Jie Shi

In this paper we provide new compact integral expressions and associated simple asymptotic approximations for converse and achievability bounds in the finite blocklength regime. The chosen converse and random coding union bounds were taken…

Information Theory · Computer Science 2016-10-25 Tomaso Erseghe

Stabilization of non-stationary linear systems over noisy communication channels is considered. Stochastically stable sources, and unstable but noise-free or bounded-noise systems have been extensively studied in information theory and…

Information Theory · Computer Science 2012-05-07 Serdar Yüksel

We address the recently suggested problem of causal lossless coding of a randomly arriving source samples. We construct variable-to-fixed coding schemes and show that they outperform the previously considered fixed-to-variable schemes when…

Information Theory · Computer Science 2020-10-27 Uri Abend , Anatoly Khina

The article is devoted to stochastic processes with values in finite- and infinite-dimensional vector spaces over infinite fields $\bf K$ of zero characteristics with non-trivial non-archimedean norms. For different types of stochastic…

Probability · Mathematics 2018-12-18 S. V. Ludkovsky

The number of random bits required to approximate a target distribution in terms of un-normalized informational divergence is considered. It is shown that for a variable-to-variable length encoder, this number is lower bounded by the…

Information Theory · Computer Science 2013-08-02 Georg Böcherer , Rana Ali Amjad

We study dynamical reversibility in stationary stochastic processes from an information theoretic perspective. Extending earlier work on the reversibility of Markov chains, we focus on finitary processes with arbitrarily long conditional…

Statistical Mechanics · Physics 2015-05-28 Christopher J. Ellison , John R. Mahoney , Ryan G. James , James P. Crutchfield , Joerg Reichardt

This paper investigates the problem of variable-length lossy source coding allowing a positive excess distortion probability and an overflow probability of codeword lengths. Novel one-shot achievability and converse bounds of the optimal…

Information Theory · Computer Science 2018-12-17 Shota Saito , Hideki Yagi , Toshiyasu Matsushima

This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error…

Information Theory · Computer Science 2014-03-05 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

Universal fixed-to-variable lossless source coding for memoryless sources is studied in the finite blocklength and higher-order asymptotics regimes. Optimal third-order coding rates are derived for general fixed-to-variable codes and for…

Information Theory · Computer Science 2014-12-16 Oliver Kosut , Lalitha Sankar