English
Related papers

Related papers: Boundary effect of deterministic dense coding

200 papers

We discuss asymptotics for the boundary of critical Boltzmann planar maps under the assumption that the distribution of the degree of a typical face is in the domain of attraction of a stable distribution with parameter $\alpha \in (1,2)$.…

Probability · Mathematics 2017-11-30 Loïc Richier

We study a random partial covering model on the $(d-1)$-dimensional unit sphere, where $N$ spherical caps are placed independently and uniformly at random, each covering a surface fraction of $1/N$. This model provides a continuous…

Probability · Mathematics 2026-04-10 Steven Hoehner , Christoph Thäle

For $n,d,w \in \mathbb{N}$, let $A(n,d,w)$ denote the maximum size of a binary code of word length $n$, minimum distance $d$ and constant weight $w$. Schrijver recently showed using semidefinite programming that $A(23,8,11)=1288$, and the…

Combinatorics · Mathematics 2018-12-03 Andries E. Brouwer , Sven C. Polak

In a recent work, Coronel et al. initiated the study of the relation between the diversity-multiplexing tradeoff (DMT) performance of a multiuser multiple-input multiple-output (MU-MIMO) lattice code and the rate of the decay of the…

Information Theory · Computer Science 2009-08-19 Jyrki Lahtonen , Roope Vehkalahti , Hsiao-feng Lu , Camilla Hollanti , Emanuele Viterbo

We prove a deviation bound for the maximum of partial sums of functions of $\alpha$-dependent sequences as defined in Dedecker, Gou{\"e}zel and Merlev{\`e}de (2010). As a consequence, we extend the Rosenthal inequality of Rio (2000) for…

Probability · Mathematics 2016-01-22 J Dedecker , Florence Merlevède

We investigate the upper and lower bounds on the quantization distortions for independent and identically distributed sources in the finite block-length regime. Based on the convex optimization framework of the rate-distortion theory, we…

Information Theory · Computer Science 2013-06-21 Chen Gong , Xiaodong Wang

We consider random interlacements on $ \mathbb{Z}^d$, $d \ge 3$, when their vacant set is in a strongly percolative regime. Given a large box centered at the origin, we establish an asymptotic upper bound on the exponential rate of decay of…

Probability · Mathematics 2021-11-03 Alain-Sol Sznitman

We study the integration and approximation problems for monotone and convex bounded functions that depend on $d$ variables, where $d$ can be arbitrarily large. We consider the worst case error for algorithms that use finitely many function…

Numerical Analysis · Mathematics 2013-12-13 Aicke Hinrichs , Erich Novak , Henryk Woźniakowski

We discuss the plastic behavior of an amorphous matrix reinforced by hard particles. A mesoscopic depinning-like model accounting for Eshelby elastic interactions is implemented. Only the effect of a plastic disorder is considered.…

Materials Science · Physics 2016-02-17 Botond Tyukodi , Claire A. Lemarchand , Jesper S. Hansen , Damien Vandembroucq

High-dimensional data sets are commonly collected in many contemporary applications arising in various fields of scientific research. We present two views of finite samples in high dimensions: a probabilistic one and a nonprobabilistic one.…

Statistics Theory · Mathematics 2013-11-13 Jinchi Lv

Tight bounds for several symmetric divergence measures are derived in terms of the total variation distance. It is shown that each of these bounds is attained by a pair of 2 or 3-element probability distributions. An application of these…

Information Theory · Computer Science 2016-11-17 Igal Sason

A detailed analysis of the finite-size effects on the bulk critical behaviour of the $d$-dimensional mean spherical model confined to a film geometry with finite thickness $L$ is reported. Along the finite direction different kinds of…

Statistical Mechanics · Physics 2008-08-12 H. Chamati

There is a large literature devoted to the problem of finding an optimal (min-cost) prefix-free code with an unequal letter-cost encoding alphabet of size. While there is no known polynomial time algorithm for solving it optimally there are…

Information Theory · Computer Science 2007-07-13 Mordecai Golin , Li Jian

We consider a generalization of the so-called divide and color model recently introduced by Haggstrom. We investigate the behaviour of the magnetization in large boxes and its fluctuations. Thus, laws of large numbers and Central Limit…

Probability · Mathematics 2007-05-23 Olivier Garet

In this paper, we produce two new classes of entanglement-assisted quantum MDS codes (EAQMDS codes) with length $n|q^2-1$ and $n|q^2+1$ via cyclic codes over finite fields of odd characteristic. Among our constructions there are many EAQMDS…

Information Theory · Computer Science 2020-08-27 Renjie Jin , Derong Xie , Jinquan Luo

We analytically and numerically study the effect of finite spatial boundaries on the Takayasu model of diffusing and aggregating particles with steady monomer input in one dimension. Exact expressions are derived for the steady-state…

Statistical Mechanics · Physics 2025-11-13 Rohan Banerjee Ravindran , R. Rajesh

We discuss the finite-size properties of a simple integrable quantum field theory in 1+1 dimensions with non-trivial boundary conditions. Novel off-critical identities between cylinder partition functions of models with differing boundary…

High Energy Physics - Theory · Physics 2009-10-16 P. Dorey , M. Pillin , A. Pocklington , I. Runkel , R. Tateo , G. M. T. Watts

We study free particles in a one-dimensional box with combinations of two types of boundary conditions: the Dirichlet condition and a one-parameter family of quasi-Neumann conditions at the two walls. We calculate energy spectra…

Mathematical Physics · Physics 2014-11-18 Nobuhiro Yonezawa

We describe methods for proving upper and lower bounds on infinite-time averages in deterministic dynamical systems and on stationary expectations in stochastic systems. The dynamics and the quantities to be bounded are assumed to be…

Dynamical Systems · Mathematics 2017-02-09 Giovanni Fantuzzi , David Goluskin , Deqing Huang , Sergei I. Chernyshenko

This paper introduces a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes, this…

Information Theory · Computer Science 2015-06-16 Santhosh Kumar , Henry D. Pfister
‹ Prev 1 3 4 5 6 7 10 Next ›