Related papers: On extendibility of additive code isometries
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…
For a linear code $C$ over a finite field, if its dual code $C^{\perp}$ is equivalent to itself, then the code $C$ is said to be {\it isometry-dual}. In this paper, we first confirm a conjecture about the isometry-dual MDS elliptic codes…
We consider a global, nonlinear version of the Whitney extension problem for manifold-valued smooth functions on closed domains $C$, with non-smooth boundary, in possibly non-compact manifolds. Assuming $C$ is a submanifold with corners, or…
The classic Maxwell formula calculates the length of a planar locally minimal binary tree in terms of coordinates of its boundary vertices and directions of incoming edges. However, if an extreme tree with a given topology and a boundary…
We introduce new sufficient conditions for permutation and monomial equivalence of linear cyclic codes over various finite fields. We recall that monomial equivalence and isometric equivalence are the same relation for linear codes over…
In this paper, we obtain two extension theorems for cohomology classes and holomorphic sections defined on analytic subvarieties, which are defined as the supports of the quotient sheaves of multiplier ideal sheaves of…
Karush's proof of McMillan's theorem is recast as an argument involving polynomials with non-commuting indeterminates certain evaluations of which yield the Kraft sums of codes, proving a strengthened version of McMillan's theorem.
Shearer and McEliece [1977] showed that there is no MacWilliams identity for the free distance spectra of orthogonal linear convolutional codes. We show that on the other hand there does exist a MacWilliams identity between the generating…
We prove extension-dimensional versions of finite dimensional selection and approximation theorems. As applications, we obtain several results on extension dimension.
In this paper we define a notion of S-extension for a metric space and study minimality and coherence of S-extensions. We show that every S-extension can be identified with an algebraic object. We use this algebraic representation to give a…
Combinatorial designs are closely related to linear codes. In recent year, there are a lot of $t$-designs constructed from certain linear codes. In this paper, we aim to construct $2$-designs from binary three-weight codes. For any binary…
We prove an analogue of Kac's Theorem, describing the dimension vectors of indecomposable coherent sheaves, or parabolic bundles, over weighted projective lines. We use a theorem of Peng and Xiao to associate a Lie algebra to the category…
In this paper we present an extension of known semidefinite and linear programming upper bounds for spherical codes and consider a version of this bound for distance graphs. We apply the main result for the distance distribution of a…
We formulate a multi-valued version of the Tietze-Urysohn extension theorem. Precisely, we prove that any upper semicontinuous multi-valued map with nonempty closed convex values defined on a closed subset (resp. closed perfectly normal…
The main purpose of this paper is to generalize the celebrated L${}^2$ extension theorem of Ohsawa-Takegoshi in several directions : the holomorphic sections to extend are taken in a possibly singular hermitian line bundle, the subvariety…
We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…
Both maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes (non-GRS MDS codes) and near MDS (NMDS) codes have nice applications in communication and storage systems. In this paper, we…
We investigate linear codes over the ring $\mathbb{Z}_4 + u\mathbb{Z}_4 + v\mathbb{Z}_4 + w\mathbb{Z}_4 + uv\mathbb{Z}_4 + uw\mathbb{Z}_4 + vw\mathbb{Z}_4 + uvw\mathbb{Z}_4$, with conditions $u^2=u$, $v^2=v$, $w^2=w$, $uv=vu$, $uw=wu$ and…
Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…
The hull of linear codes have promising utilization in coding theory and quantum coding theory. In this paper, we study the hull of generalized Reed-Solomon codes and extended generalized Reed-Solomon codes over finite fields with respect…