Related papers: MacWilliams Extension Theorem for MDS additive cod…
It's well known that MDS, AMDS or self dual codes have good algebraic properties, and are applied in communication systems, data storage, quantum codes, and so on. In this paper, we focus on a class of generalized Roth-Lempel linear codes…
Codes considered as structures within unit schemes greatly extends the availability of linear block and convolutional codes and allows the construction of these codes to required length, rate, distance and type. Properties of a code emanate…
We generalize McDiarmid's inequality for functions with bounded differences on a high probability set, using an extension argument. Those functions concentrate around their conditional expectations. We further extend the results to…
Linear code with complementary dual($LCD$) are those codes which meet their duals trivially. In this paper we will give rather alternative proof of Massey's theorem\cite{Massey2}, which is one of the most important characterization of $LCD$…
We prove an analogue of E. Levi's Continuity Principle for meromorphic mappings with values in arbitrary compact complex manifolds in place of the Riemann sphere $\cc\pp^1$. The result is achieved by introducing a new extension method for…
A partition of a finite abelian group gives rise to a dual partition on the character group via the Fourier transform. Properties of the dual partitions are investigated and a convenient test is given for the case that the bidual partition…
Open discrete mappings with a modulus condition in metric spaces are considered. Some results related to local behavior of mappings as well as theorems about continuous extension to a boundary are proved.
In this paper, I prove a very general extension theorem for log pluricanonical systems. The main application of this extension theorem is (together with Kawamata's subadjunction theorem) to give an optimal subadjunction theorem which…
Some known fixed point theorems for nonexpansive mappings in metric spaces are extended here to the case of primitive uniform spaces. The reasoning presented in the proofs seems to be a natural way to obtain other general results.
In this paper, we investigate the existence of self-dual MRD codes $C\subset L^n$, where $L/F$ is an arbitrary field extension of degree $m\geq n$. We then apply our results to the case of finite fields, and prove that if $m=n$ and…
Extension dimension is characterized in terms of $\omega$-maps. We apply this result to prove that extension dimension is preserved by refinable maps between metrizable spaces. It is also shown that refinable maps preserve some…
Basic algebraic and combinatorial properties of finite vector spaces in which individual vectors are allowed to have multiplicities larger than $ 1 $ are derived. An application in coding theory is illustrated by showing that multispace…
Linear complementary-dual (LCD for short) codes are linear codes that intersect with their duals trivially. LCD codes have been used in certain communication systems. It is recently found that LCD codes can be applied in cryptography. This…
We consider polynomial codes for private distributed matrix multiplication (PDMM/SDMM). Existing codes for PDMM are either specialized for the outer product partitioning (OPP), or inner product partitioning (IPP), or are valid for the more…
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.
Pomset block metric is a generalization of pomset metric. In this paper, we define weight enumerator of linear block codes in pomset metric over $\mathbb{Z}_m$ and establish MacWilliams type identities for linear block codes with respect to…
The hull $H(C)$ of a linear code $C$ is defined by $H(C)=C \cap C^\perp$. A linear code with a complementary dual (LCD) is a linear code with $H(C)=\{0\}$. The dimension of the hull of a code is an invariant under permutation equivalence.…
In this paper, we consider the Reed-Muller (RM) codes. For the first order RM code, we prove that it is unique in the sense that any linear code with the same length, dimension and minimum distance must be the first order RM code; For the…
In this paper, we study the general extension problem for isometric immersions by establishing Cartan-Ambrose-Hicks theorems based on submanifolds. Our method also provides geometric constructions of such extensions.
We study when a map between two subsets of a Boolean domain W can be extended to an automorphism of W. Under many hypotheses, if the underlying Boolean algebra is complete or if the sets are finite or Boolean domains, the necessary and…