English
Related papers

Related papers: Asymptotic Concentration Behaviors of Linear Combi…

200 papers

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ć

This paper studies the concentration properties of random codes. Specifically, we show that, for discrete memoryless channels, the error exponent of a randomly generated code with pairwise-independent codewords converges in probability to…

Information Theory · Computer Science 2022-03-16 Lan V. Truong , Giuseppe Cocco , Josep Font-Segura , Albert Guillén i Fàbregas

We estimate the variance of weight and stopping set distribution of regular LDPC ensembles. Using this estimate and the second moment method we obtain bounds on the probability that a randomly chosen code from regular LDPC ensemble has its…

Information Theory · Computer Science 2016-11-18 Vishwambhar Rathi

In this paper Raptor code ensembles with linear random precodes in a fixed-rate setting are considered. An expression for the average distance spectrum is derived and this expression is used to obtain the asymptotic exponent of the weight…

Information Theory · Computer Science 2015-04-22 Francisco Lázaro , Enrico Paolini , Gianluigi Liva , Gerhard Bauch

A statistical estimation algorithm of the weight distribution of a linear code is shown, based on using its generator matrix as a compression function on random bit strings.

Information Theory · Computer Science 2018-06-07 Alessandro Tomasi , Alessio Meneghetti

We derive the asymptotic distribution of ordinal-pattern frequencies under weak dependence conditions and investigate the long-run covariance matrix not only analytically for moving-average, Gaussian, and the novel generalized coin-tossing…

Statistics Theory · Mathematics 2025-07-24 Angelika Silbernagel , Christian Weiß

We investigate the weight distribution of random binary linear codes. For $0<\lambda<1$ and $n\to\infty$ pick uniformly at random $\lambda n$ vectors in $\mathbb{F}_2^n$ and let $C \le \mathbb{F}_2^n$ be the orthogonal complement of their…

Information Theory · Computer Science 2024-07-11 Nati Linial , Jonathan Mosheiff

We investigate the asymptotic density of error-correcting codes with good distance properties and prescribed linearity degree, including sublinear and nonlinear codes. We focus on the general setting of finite translation-invariant metric…

Information Theory · Computer Science 2023-06-06 Anina Gruica , Anna-Lena Horlemann , Alberto Ravagnani , Nadja Willenborg

We study asymptotic behaviour of stochastic approximation procedures with three main characteristics: truncations with random moving bounds, a matrix valued random step-size sequence, and a dynamically changing random regression function.…

Statistics Theory · Mathematics 2016-11-22 Teo Sharia , Lei Zhong

In this paper, an expression for the asymptotic growth rate of the number of small linear-weight codewords of irregular doubly-generalized LDPC (D-GLDPC) codes is derived. The expression is compact and generalizes existing results for LDPC…

Information Theory · Computer Science 2010-05-05 Mark F. Flanagan , Enrico Paolini , Marco Chiani , Marc Fossorier

The problem of channel coding with the erasure option is revisited for discrete memoryless channels. The interplay between the code rate, the undetected and total error probabilities is characterized. Using the information spectrum method,…

Information Theory · Computer Science 2015-10-22 Masahito Hayashi , Vincent Y. F. Tan

In this paper, we derive the average weight distributions for the irregular non-binary cluster low-density parity-check (LDPC) code ensembles. Moreover, we give the exponential growth rate of the average weight distribution in the limit of…

Information Theory · Computer Science 2015-06-15 Takayuki Nozaki , Masaki Maehara , Kenta Kasai , Kohichi Sakaniwa

The average weight distribution of a regular low-density parity-check (LDPC) code ensemble over a finite field is thoroughly analyzed. In particular, a precise asymptotic approximation of the average weight distribution is derived for the…

Information Theory · Computer Science 2015-03-17 Shengtian Yang , Thomas Honold , Yan Chen , Zhaoyang Zhang , Peiliang Qiu

We compute asymptotic non-linear shrinkage formulas for covariance and precision matrix estimators for weighted sample covariances, and the joint sample-population eigenvector overlap distribution, in the spirit of Ledoit and P\'ech\'e. We…

Statistics Theory · Mathematics 2025-03-21 Benoit Oriol

A fundamental property of codes, the second-order weight distribution, is proposed to solve the problems such as computing second moments of weight distributions of linear code ensembles. A series of results, parallel to those for weight…

Information Theory · Computer Science 2011-11-15 Shengtian Yang

In this paper, an analysis of the undetected error probability of ensembles of binary matrices is presented. The ensemble called the Bernoulli ensemble whose members are considered as matrices generated from i.i.d. Bernoulli source is…

Information Theory · Computer Science 2008-04-08 Tadashi Wadayama

Cumulative weight enumerators of random linear codes are introduced, their asymptotic properties are studied, and very sharp thresholds are exhibited; as a consequence, it is shown that the asymptotic Gilbert-Varshamov bound is a very sharp…

Information Theory · Computer Science 2012-12-27 Yun Fan , San Ling , Hongwei Liu , Jing Shen , Chaoping Xing

We obtain an asymptotic normality result that reveals the precise asymptotic behavior of the maximum likelihood estimators of parameters for a very general class of linear mixed models containing cross random effects. In achieving the…

Statistics Theory · Mathematics 2026-02-10 Jiming Jiang , Matt P. Wand , Swarnadip Ghosh

Hierarchical statistical models are widely employed in information science and data engineering. The models consist of two types of variables: observable variables that represent the given data and latent variables for the unobservable…

Machine Learning · Statistics 2014-02-21 Keisuke Yamazaki

This paper considers error probabilities of random codes for memoryless channels in the fixed-rate regime. Random coding is a fundamental scheme to achieve the channel capacity and many studies have been conducted for the asymptotics of the…

Information Theory · Computer Science 2017-07-17 Junya Honda
‹ Prev 1 2 3 10 Next ›