Related papers: MacWilliams Identities for Terminated Convolutiona…
It is conjectured by Golomb and Welch around half a century ago that there is no perfect Lee codes $C$ of packing radius $r$ in $\mathbb{Z}^{n}$ for $r\geq2$ and $n\geq 3$. Recently, Leung and the second author proved this conjecture for…
Codes considered as structures within unit schemes greatly extends the availability of linear block and convolutional codes and allows the construction of these codes to required length, rate, distance and type. Properties of a code emanate…
In 1997 Rosenthal and York defined generalized Hamming weights for convolutional codes, by regarding a convolutional code as an infinite dimensional linear code endowed with the Hamming metric. In this paper, we propose a new definition of…
In this work we explore the potential of a new data-driven approach to the design of exchange-correlation (XC) functionals. The approach, inspired by convolutional filters in computer vision and surrogate functions from optimization,…
In this paper, we present a new exact algorithm for counting perfect matchings, which relies on neither inclusion-exclusion principle nor tree-decompositions. For any bipartite graph of $2n$ nodes and $\Delta n$ edges such that $\Delta \geq…
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…
Gleason's 1970 theorem on weight enumerators of self-dual codes has played a crucial role for research in coding theory during the last four decades. Plenty of generalizations have been proved but, to our knowledge, they are all based on…
In this article, we establish a general covariance identity for infinitely divisible distributions (IDD). Using this result, we derive Cacoullos type variance bounds for the IDD. Applications to some important distributions are discussed,…
We build a valid p-value based on a concentration inequality for bounded random variables introduced by Pelekis, Ramon and Wang. The motivation behind this work is the calibration of predictive algorithms in a distribution-free setting. The…
We give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of…
The weight distribution of the binary self-dual $[128,64]$ code being the extended code $C^{*}$ of the code $C$ spanned by the incidence vectors of the blocks of the polarity design in $PG(6,2)$ [11] is computed. It is shown also that…
We derive generalizations of McShane's identity for higher ranked surface group representations by studying a family of mapping class group invariant functions introduced by Goncharov and Shen which generalize the notion of horocycle…
In this note, we establish an analog of the Mallows-Sloane bound for Type III formal weight enumerators. This completes the bounds for all types (Types I through IV) in synthesis of our previous results. Next we show by using the binomial…
In this paper, we characterize the average Hamming weight distribution of subsequences of maximum-length sequences ($m$-sequences). In particular, we consider all possible $m$-sequences of dimension $k$ and find the average number of…
Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was…
This paper investigates model reduction methods for efficiently approximating the solution of parameter-dependent PDEs with a multi-parameter vector $\vec{\mu} \in \mathbb{R}^p$. In cases where the Kolmogorov $N$-width decays fast enough,…
Heavy-tailed distributions naturally occur in many real life problems. Unfortunately, it is typically not possible to compute inference in closed-form in graphical models which involve such heavy-tailed distributions. In this work, we…
Linear codes with a few weights have important applications in authentication codes, secret sharing, consumer electronics, etc.. The determination of the parameters such as Hamming weight distributions and complete weight enumerators of…
The concept of parity check matrices of linear binary codes has been extended by Heden [9] to parity check systems of nonlinear binary codes. In the present paper we extend this concept to parity check systems of nonlinear codes over finite…
In this paper, we study some vanishing identities for Gromov-Witten invariants conjectured by K. Liu and H. Xu. We will prove these conjectures in the case that the summation range is large compare to genus. In fact, in such cases, we can…