English
Related papers

Related papers: On the weight distribution of random binary linear…

200 papers

We examine a random model consisting of objects with positive weights and evolving in discrete time steps, which generalizes certain random graph models. We prove almost sure convergence for the weight distribution and show scale-free…

Probability · Mathematics 2014-11-10 Ágnes Backhausz , Tamás F. Móri

We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…

Information Theory · Computer Science 2023-12-25 Peter Beelen , Trygve Johnsen , Prasant Singh

Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power…

Information Theory · Computer Science 2016-05-12 Ziling Heng , Qin Yue

Cyclic codes have efficient encoding and decoding algorithms. The decoding error probability and the undetected error probability are usually bounded by or given from the weight distributions of the codes. Most researches are about the…

Information Theory · Computer Science 2013-09-03 Xiaogang Liu , Yuan Luo

We outline a general procedure on how to apply random positive linear operators in nonparametric estimation. As a consequence, we give explicit confidence bands and intervals for a distribution function $F$ concentrated on $[0,1]$ by means…

Statistics Theory · Mathematics 2025-08-20 José A. Adell , J. T. Alcalá , C. Sangüesa

Lower and upper bounds are explored for the uniform (Kolmogorov) and $L^2$-distances between the distributions of weighted sums of dependent summands and the normal law. The results are illustrated for several classes of random variables…

Probability · Mathematics 2023-08-08 S. G. Bobkov , G. P. Chistyakov , F. Götze

Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…

Information Theory · Computer Science 2024-05-31 Wei Lu , Qingyao Wang , Xiaoqiang Wang , Dabin Zheng

We consider a (random permutation model) binary search tree with n nodes and give asymptotics on the loglog scale for the height H_n and saturation level h_n of the tree as n\to\infty, both almost surely and in probability. We then consider…

Probability · Mathematics 2010-02-23 Matthew I. Roberts

We establish a comprehensive probability theory for coherent transport of random waves through arbitrary linear media. The transmissivity distribution for random coherent waves is a fundamental B-spline with knots at the transmission…

Optics · Physics 2025-11-07 Yunrui Wang , Cheng Guo

The determination of the weight distribution of linear codes has been a fascinating problem since the very beginning of coding theory. There has been a lot of research on weight enumerators of special cases, such as self-dual codes and…

Combinatorics · Mathematics 2021-09-28 Alessio Meneghetti , Marco Pellegrini , Massimiliano Sala

We consider the distribution of cycles in two models of random permutations, that are related to one another. In the first model, cycles receive a weight that depends on their length. The second model deals with permutations of points in…

Probability · Mathematics 2011-02-24 Volker Betz , Daniel Ueltschi

This paper investigates the relationship between the rank weight distribution of a linear code and that of its dual code. The main result of this paper is that, similar to the MacWilliams identity for the Hamming metric, the rank weight…

Information Theory · Computer Science 2007-07-13 Maximilien Gadouleau , Zhiyuan Yan

We consider a sequence of random Hamiltonians $H_n(h,\sigma)=\sum^n_{i=1}h_i(\sigma_i-m)$, and study the asymptotic ($n\to \infty$) distribution of the energy levels $(H_n(h,\sigma))_{\sigma\in \{-1,1\}^n}$, where $h_1,h_2,\cdots$ are…

Probability · Mathematics 2026-04-08 Francesco Concetti , Simone Franchini

Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. So far, most of previous results obtained were for cyclic codes with no more than three zeros. Recently, \cite{Y-X-D12}…

Number Theory · Mathematics 2014-05-27 Jing Yang , Lingli Xia , Maosheng Xiong

This paper derives the asymptotic distribution of variance weighted Kolmogorov-Smirnov statistics for conditional moment inequality models for the case of a one dimensional covariate. The asymptotic distribution depends on the data…

Methodology · Statistics 2012-02-02 Timothy B. Armstrong

In this paper, based on the theory of defining sets, two classes of five-weight or six-weight linear codes over Fp are constructed. The weight distributions of the linear codes are determined by means of Weil sums and a new type of…

Information Theory · Computer Science 2021-04-09 Xina Zhang

The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. In this paper, we investigate the generalized Hamming weights of two classes of linear codes constructed from defining sets and determine them completely…

Information Theory · Computer Science 2019-05-08 Gaopeng Jian

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

Let $p(n)$ be the number of all integer partitions of the positive integer $n$ and let $\lambda$ be a partition, selected uniformly at random from among all such $p(n)$ partitions. It is known that each partition $\lambda$ has a unique…

Combinatorics · Mathematics 2019-12-06 Ljuben Mutafchiev

We investigate the variance of the length of the longest common subsequences of two independent random words of size $n$, where the letters of one word are i.i.d. uniformly drawn from $\{\alpha_1, \alpha_2, \cdots, \alpha_m\}$, while the…

Probability · Mathematics 2018-12-27 Christian Houdré , Qingqing Liu