Related papers: Cumulative Distance Enumerators of Random Codes an…
We study the distribution of a fully connected neural network with random Gaussian weights and biases in which the hidden layer widths are proportional to a large constant $n$. Under mild assumptions on the non-linearity, we obtain…
In this work type II Hermite-Pad\'e approximants for a vector of Cauchy transforms of smooth Jacobi-type densities are considered. It is assumed that densities are supported on mutually disjoint intervals (an Angelesco system with complex…
Let $n_k(s)$ be the maximal length $n$ such that a quaternary additive $[n,k,n-s]_4$-code exists. We solve a natural asymptotic problem by determining the lim sup $\lambda_k$ of $n_k(s)/s,$ and the smallest value of $s$ such that…
We study the joint distribution of the input sum and the output sum of a deterministic transducer. Here, the input of this finite-state machine is a uniformly distributed random sequence. We give a simple combinatorial characterization of…
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…
Few-weight codes have been constructed and studied for many years, since their fascinating relations to finite geometries, strongly regular graphs and Boolean functions. Simplex codes are one-weight Griesmer $[\frac{q^k-1}{q-1},k…
We investigate two fundamental questions intersecting coding theory and combinatorial geometry, with emphasis on their connections. These are the problem of computing the asymptotic density of MRD codes in the rank metric, and the Critical…
We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…
This paper develops an algorithmic approach for obtaining estimates of the weight enumerators of Reed-Muller (RM) codes. Our algorithm is based on a technique for estimating the partition functions of spin systems, which in turn employs a…
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen's inequality as well as some other inequalities in the derivation, we demonstrate that an exponentially…
In this paper, for an odd prime $p$, by extending Li et al.'s construction \cite{CL2016}, several classes of two-weight and three-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from a defining set, and then their…
We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R=1/2, by our constructive lower bound,…
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…
In Random Matrix Theory the local correlations of the Laguerre and Jacobi Unitary Ensemble in the hard edge scaling limit can be described in terms of the Bessel kernel (containing a parameter $\alpha$). In particular, the so-called hard…
A sharp upper bound for the maximum integer not belonging to an ideal of a numerical semigroup is given and the ideals attaining this bound are characterized. Then the result is used, through the so-called Feng-Rao numbers, to bound the…
We consider the weight spectrum of a class of quasi-perfect binary linear codes with code distance 4. For example, extended Hamming code and Panchenko code are the known members of this class. Also, it is known that in many cases Panchenko…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…
In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.
We study relationships between worst-case and random-noise properties of error correcting codes. More concretely, we consider connections between minimum distance, list decoding radius, and block error probability on noisy channels. A…