Related papers: Geometric approach to the MacWilliams Extension Th…

The Galois hulls of linear codes are a generalization of the Euclidean and Hermitian hulls of linear codes. In this paper, we study the Galois hulls of (extended) GRS codes and present several new constructions of MDS codes with Galois…

The MacWilliams identity for linear time-invariant convolutional codes that has recently been found by Gluesing-Luerssen and Schneider is proved concisely, and generalized to arbitrary group codes on graphs. A similar development yields a…

In this text we develop some aspects of Harder-Narasimhan theory, slopes, semistability and canonical filtration, in the setting of combinatorial lattices. Of noticeable importance is the Harder-Narasimhan structure associated to a Galois…

In this paper, we examine the binary linear codes with respect to Hamming metric from incidence matrix of a unit graph $G(\mathbb{Z}_{n})$ with vertex set is $\mathbb{Z}_{n}$ and two distinct vertices $x$ and $y$ being adjacent if and only…

We show that a Moore space M(Z_m,1) is an absolute extensor for finite dimensional metrizable spaces of cohomological dimension dim_{Z_m} \leq 1.

Let $\Sigma$ be a codimension one submanifold of an $n$-dimensional Riemannian manifold $M$, $n\geqslant 2$. We give a necessary condition for an isometric immersion of $\Sigma$ into $\mathbb R^q$ equipped with the standard Euclidean…

We study the minimum distance of codes defined on bipartite graphs. Weight spectrum and the minimum distance of a random ensemble of such codes are computed. It is shown that if the vertex codes have minimum distance $\ge 3$, the overall…

Hermitian hulls of linear codes are interesting for theoretical and practical reasons alike. In terms of recent application, linear codes whose hulls meet certain conditions have been utilized as ingredients to construct…

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 present a short and self-contained proof of the extension property for partial isometries of the class of all finite metric spaces.

We show that for every connected analytic subvariety $V$ there is a pseudoconvex set $\Omega$ such that every bounded matrix-valued holomorphic function on $V$ extends isometrically to $\Omega$. We prove that if $V$ is two analytic disks…

We obtain a characterization on self-orthogonality for a given binary linear code in terms of the number of column vectors in its generator matrix, which extends the result of Bouyukliev et al. (2006). As an application, we give an…

We prove an asymptotic analog of the classical Hurewicz theorem on mappings which lower dimension. This theorem allows us to find sharp upper bound estimates for the asymptotic dimension of groups acting on finite dimensional metric spaces…

Let k be an algebraically closed field, let R be an associative k-algebra, and let F = {M_a: a in I} be a family of orthogonal points in R-Mod such that End_R(M_a) = k for all a in I. Then Mod(F), the minimal full sub-category of R-Mod…

Hermitean Clifford analysis is a higher dimensional function theory centered around the simultaneous null solutions, called Hermitean monogenic functions, of two Hermitean conjugate complex Dirac operators. As an essential step towards the…

The notion of phantom extension of order a given ordinal $\alpha $ has been introduced in collaboration with Casarosa, as an algebraic analogue of the order of a phantom map in topology, to study the structure of flat modules. In this…

We give a generalization of Kung's theorem on critical exponents of linear codes over a finite field, in terms of sums of extended weight polynomials of linear codes. For all i=k+1,...,n, we give an upper bound on the smallest integer m…

We prove a new selection theorem for multivalued mappings of C-space. Using this theorem we prove extension dimensional version of Hurewicz theorem for a closed mapping $f\colon X\to Y$ of $k$-space $X$ onto paracompact $C$-space $Y$: if…

Linear programming approaches have been applied to derive upper bounds on the size of classical codes and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance, including nonadditive…

Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes with desirable properties is an interesting research topic.…