Related papers: MacWilliams Extension Theorem for MDS additive cod…
In this paper we study codes where the alphabet is a finite Frobenius bimodule over a finite ring. We discuss the extension property for various weight functions. Employing an entirely character-theoretic approach and a duality theory for…
In this paper, we obtain some new results on the existence of MDS self-dual codes utilizing (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. For some fixed $q$, our results can produce more classes of MDS…
In this article we prove Griesmer type bounds for additive codes over finite fields. These new bounds give upper bounds on the length of maximum distance separable (MDS) codes, codes which attain the Singleton bound. We will also consider…
Linear codes are considered over the ring $\mathbb{Z}_4+v\mathbb{Z}_4$, where $v^2=v$. Gray weight, Gray maps for linear codes are defined and MacWilliams identity for the Gray weight enumerator is given. Self-dual codes, construction of…
In our recent paper we characterized the extension property for symmetrized weight composition for linear codes over a module alphabet. Several improvements for the case of vector space alphabets are given in this paper. A detailed…
We prove a monotone Sobolev extension theorem for maps to Jordan domains with rectifiable boundary in metric surfaces of locally finite Hausdorff 2-measure. This is then used to prove a uniformization result for compact metric surfaces by…
MacWilliams proved that every finite field has the extension property for Hamming weight which was later extended in a seminal work by Wood who characterized finite Frobenius rings as precisely those rings which satisfy the MacWilliams…
In set theory without the axiom of Choice ZF, we prove that for every commutative field IK, the following statement D_{\IK}: "On every non null IK-vector space, there exists a non null linear form" implies the existence of a IK-linear…
We prove some extension theorems involving uniformly continuous maps of the universal Urysohn space. We also prove reconstruction theorems for certain groups of autohomeomorphisms of this space and of its open subsets.
We address the following question: Can we expand an NIP theory by adding a linear order such that the expansion is still NIP? Easily, if acl(A)=A for all A, then this is true. Otherwise, we give counterexamples. More precisely, there is a…
We introduce a general class of regular weight functions on finite abelian groups, and study the combinatorics, the duality theory, and the metric properties of codes endowed with such functions. The weights are obtained by composing a…
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 prove an extension theorem for roots and logarithms of holomorphic line bundles across strictly pseudoconcave boundaries: they extend in all cases except one, when dimension and Morse index of a critical point is two. In that case we…
Let $\mathbf{H}$ be the cartesian product of a family of left modules over a ring $S$, indexed by a finite set $\Omega$. We are concerned with the $(\mathbf{P},\omega)$-weight on $\mathbf{H}$, where…
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the…
The GM-MDS theorem, conjectured by Dau-Song-Dong-Yuen and proved by Lovett and Yildiz-Hassibi, shows that the generator matrices of Reed-Solomon codes can attain every possible configuration of zeros for an MDS code. The recently emerging…
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…
We previously proposed the first nontrivial examples of a code having support $t$-designs for all weights obtained from the Assmus-Mattson theorem and having support $t'$-designs for some weights with some $t'>t$. This suggests the…
A multiple conjugation quandle is an algebra whose axioms are motivated from handlebody-knot theory. Any linear extension of a multiple conjugation quandle can be described by using a pair of maps called an MCQ Alexander pair. In this…
Motivated by a problem in computer architecture we introduce a notion of the perfect distance-dominating set, PDDS, in a graph. PDDSs constitute a generalization of perfect Lee codes, diameter perfect codes, as well as other codes and…