相关论文: Duality of codes supported on regular lattices, wi…
The Weyl-Kac character formula gives a beautiful closed-form expression for the characters of integrable highest-weight modules of Kac-Moody algebras. It is not, however, a formula that is combinatorial in nature, obscuring positivity. In…
Burst errors are very common in practice. There have been many designs in order to control and correct such errors. Recently, a new class of byte error control codes called spotty byte error control codes has been specifically designed to…
Asymptotic concentration behaviors of linear combinations of weight distributions on the random linear code ensemble are presented. Many important properties of a binary linear code can be expressed as the form of a linear combination of…
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 paper, a construction of constant weight codes based on the unique decomposition of elements in lattices is presented. The conditions for unique primary decomposition and unique irreducible decomposition in lattices are discussed…
The general construction of lattice (co)homology assigns to a lattice $\mathbb{Z}^r$ and a weight function $w:\mathbb{Z}^r \to \mathbb{Z}$ a bigraded $\mathbb{Z}[U]$-module $\mathbb{H}_*$. The weight function $w$ is often obtained from some…
In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…
There is a local ring $E$ of order $4,$ without identity for the multiplication, defined by generators and relations as $E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b\rangle.$ We study a special construction of self-orthogonal…
The conventional duality analysis is employed to identify a location of a critical point on a uniform lattice without any disorder in its structure. In the present study, we deal with the random planar lattice, which consists of the…
Non-Abelian Lattice Gauge Theory in Euclidean space-time of dimension d>=2 whose gauge group is any compact Lie group is related to a Spin Foam Model by an exact strong-weak duality transformation. The group degrees of freedom are…
The component-by-component (CBC) algorithm is a method for constructing good generating vectors for lattice rules for the efficient computation of high-dimensional integrals in the "weighted" function space setting introduced by Sloan and…
Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…
Bounds on linear codes play a central role in coding theory, as they capture the fundamental trade-off between error-correction capability (minimum distance) and information rate (dimension relative to length). Classical results…
This paper provides the theoretical foundation for the construction of lattice algorithms for multivariate $L_2$ approximation in the worst case setting, for functions in a periodic space with general weight parameters. Our construction…
Dualities are mathematical mappings that reveal unexpected links between apparently unrelated systems or quantities in virtually every branch of physics. Systems that are mapped onto themselves by a duality transformation are called…
Multiply constant-weight codes (MCWCs) have been recently studied to improve the reliability of certain physically unclonable function response. In this paper, we give combinatorial constructions for MCWCs which yield several new infinite…
In a seminal 2007 paper, Andrews introduced a class of combinatorial objects that generalize partitions called $k$-marked Durfee symbols. Multivariate rank generating functions for these objects have been shown by many to have interesting…
The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we…
Amenable groups are those admitting an invariant mean -- a finitely additive probability mean that assigns equal ``weight'' to any two translates of the same set. We introduce coset correct means (CCMs), a class of finitely additive means…
Analogies between codes and lattices have been extensively studied for the last decades, in this dictionary, the MacWilliams identity is the finite analog of the Jacobi-Poisson formula of the Theta function. Motivated by the random theory…