Related papers: Multidimensional Latin Bitrade
In this paper we prove a result on the structure of the elements of an additive {\it maximum rank distance (MRD) code} over the field of order two, namely that in some cases such codes must contain a semifield spread set. We use this result…
Latin squares and hypercubes are combinatorial designs with several applications in statistics, cryptography and coding theory. In this paper, we generalize a construction of Latin squares based on bipermutive cellular automata (CA) to the…
A $q$-ary code of length $n$, size $M$, and minimum distance $d$ is called an $(n,M,d)_q$ code. An $(n,q^{k},n-k+1)_q$ code is called a maximum distance separable (MDS) code. In this work, some MDS codes over small alphabets are classified.…
We consider the problem of describing the typical (possibly) non-linear code of minimum distance bounded from below over a large alphabet. We concentrate on block codes with the Hamming metric and on subspace codes with the injection…
LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field with cardinality…
Maximally embedding dimension (MED) numerical semigroups are a wide and interesting family, with some remarkable algebraic and combinatorial properties. Associated to any numerical semigroup one can construct a MED closure, as it is well…
All indecomposable unimodular hermitian lattices in dimensions 14 and 15 over the ring of integers in $\mathbb{Q}(\sqrt{-3})$ are determined. Precisely one lattice in dimension 14 and two lattices in dimension 15 have minimal norm 3.
An $[n,k,d]$ linear code is said to be maximum distance separable (MDS) or almost maximum distance separable (AMDS) if $d=n-k+1$ or $d=n-k$, respectively. If a code and its dual code are both AMDS, then the code is said to be near maximum…
Integrability of the one-dimensional Hubbard model and of the factorised scattering problem encountered on the worldsheet of AdS strings can be expressed in terms of a peculiar quantum algebra. In this article, we derive the classical limit…
One of the most fundamental topics in subspace coding is to explore the maximal possible value ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$ such that the subspace distance satisfies $\operatorname{d_S}(U,V) =…
Partial-MDS (PMDS) codes are a family of locally repairable codes, mainly used for distributed storage. They are defined to be able to correct any pattern of $s$ additional erasures, after a given number of erasures per locality group have…
A code of length $n$ is said to be (combinatorially) $(\rho,L)$-list decodable if the Hamming ball of radius $\rho n$ around any vector in the ambient space does not contain more than $L$ codewords. We study a recently introduced class of…
Let $k$ be an algebraically closed field. Fix integers $n$ and $b$ with $n\geq 3$ and $1\leq b\leq n-1.$ Let $T^d_k$ be the moduli space of hypersurfaces $[F]$ in $\mathbb{P}^n_k$ of degree $l$ whose singular locus contains a subscheme of…
We show that any partial Latin square of order $n$ can be embedded in a Latin square of order at most $16n^2$ which has at least $2n$ mutually orthogonal mates. We also show that for any $t\geq 2$, a pair of orthogonal partial Latin squares…
Partial MDS (PMDS) codes are erasure codes combining local (row) correction with global additional correction of entries, while Sector-Disk (SD) codes are erasure codes that address the mixed failure mode of current RAID systems. It has…
We extend non-emtpyness and irreducibility of Hassett divisors to the moduli spaces of $M$-polarizable cubic fourfolds for higher rank lattices $M$, which in turn provides a systematic approach for describing the irreducible components of…
Recently, Roth and Skachek proposed two methods for constructing nearly maximum-distance separable (MDS) expander codes. We show that through the simple modification of using mixed-alphabet codes derived from MDS codes as constituent codes…
A subspace code is a nonempty set of subspaces of a vector space $\mathbb F^n_q$. Linear codes with complementary duals, or LCD codes, are linear codes whose intersection with their duals is trivial. In this paper, we introduce a notion of…
Multidimensional scaling is a statistical process that aims to embed high dimensional data into a lower-dimensional space; this process is often used for the purpose of data visualisation. Common multidimensional scaling algorithms tend to…
An improved Singleton-type upper bound is presented for the list decoding radius of linear codes, in terms of the code parameters [n,k,d] and the list size L. L-MDS codes are then defined as codes that attain this bound (under a slightly…