Related papers: A Singleton Bound for Lattice Schemes
A sum-rank-metric code attaining the Singleton bound is called maximum sum-rank distance (MSRD). MSRD codes have been constructed for some parameter cases. In this paper we construct a linear MSRD code over an arbitrary field ${\bf F}_q$…
In this paper, we give a notation on the Singleton bounds for linear codes over a finite commutative quasi-Frobenius ring in the work of Shiromoto [5]. We show that there exists a class of finite commutative quasi-Frobenius rings. The…
For a subspace arrangement over a finite field we study the evaluation code defined on the arrangement's set of points. The length of this code is given by the subspace arrangement's characteristic polynomial. For coordinate subspace…
In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.
Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distributed storage. In this paper, by constructing covering codes…
Folded Reed-Solomon (FRS) and univariate multiplicity codes are prominent polynomial codes over finite fields, renowned for achieving list decoding capacity. These codes have found a wide range of applications beyond the traditional scope…
The present paper mainly studies limits and constructions of insertion and deletion (insdel for short) codes. The paper can be divided into two parts. The first part focuses on various bounds, while the second part concentrates on…
This article offers a comprehensive survey of results obtained for solitons and complex nonlinear wave patterns supported by purely nonlinear lattices (NLs), which represent a spatially periodic modulation of the local strength and sign of…
We give an independent proof of the Krasikov-Litsyn bound d/n<~(1-5^{-1/4})/2 on doubly-even self-dual binary codes. The technique used (a refinement of the Mallows-Odlyzko-Sloane approach) extends easily to other families of self-dual…
Flexible mechanical metamaterials possess repeating structural motifs that imbue them with novel, exciting properties including programmability, anomalous elastic moduli and nonlinear and robust response. We address such structures via…
We describe a new parameterized family of symmetric error-correcting codes with low-density parity-check matrices (LDPC). Our codes can be described in two seemingly different ways. First, in relation to Reed-Muller codes: our codes are…
In this thesis, we mainly investigate the lattice coding problem of the downlink communication between a base station and multiple users. The base station broadcasts a message containing each user's intended message. The capacity limit of…
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…
We describe a novel extension of subspace codes for noncoherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors. We show that when symbol erasures occur in a…
Codes defined on graphs and their properties have been subjects of intense recent research. On the practical side, constructions for capacity-approaching codes are graphical. On the theoretical side, codes on graphs provide several…
We generalize the fundamental bounds of Delsarte thesis (1973) on codes of given degree and designs of given strength in the new setting of Bannai et al. (2025). We assume the scheme is weakly metric in the sense of (Sol\'e, 1989). We give…
It is shown that an n-dimensional unimodular lattice has minimal norm at most 2[n/24] +2, unless n = 23 when the bound must be increased by 1. This result was previously known only for even unimodular lattices. Quebbemann had extended the…
Subspace codes, i.e., sets of subspaces of $\mathbb{F}_q^v$, are applied in random linear network coding. Here we give improved upper bounds for their cardinalities based on the Johnson bound for constant dimension codes.
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…
Solitons in the fractional space, supported by lattice potentials, have recently attracted much interest. We consider the limit of deep one- and two-dimensional (1D and 2D) lattices in this system, featuring finite bandgaps separated by…