Related papers: Propelinear 1-perfect codes from quadratic functio…
Observable convolutional codes defined over Zpr with the Predictable Degree Property admit minimal input/state/output representations that preserve structural properties under scalar restriction. We make use of this fact to present…
We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian…
The Johnson graph $J(v, k)$ has as vertices the $k$-subsets of $\mathcal{V}=\{1,\ldots, v\}$, and two vertices are joined by an edge if their intersection has size $k-1$. An \emph{$X$-strongly incidence-transitive code} in $J (v, k)$ is a…
In this paper we give constructions for infinite sequences of finite non-linear locally recoverable codes $\mathcal C\subseteq \prod\limits^N_{i=1}\mathbb F_{q_i}$ over a product of finite fields arising from basis expansions in algebraic…
In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.
We construct explicitly two infinite families of genuine nonadditive 1-error correcting quantum codes and prove that their coding subspaces are 50% larger than those of the optimal stabilizer codes of the same parameters via the linear…
Constacyclic codes are important classes of linear codes that have been applied to the construction of quantum codes. Six new families of asymmetric quantum codes derived from constacyclic codes are constructed in this paper. Moreover, the…
We improve Levenshtein's upper bound for the cardinality of a code of length four that is capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we construct…
Let $f \colon X \to Y$ be a morphism of concentrated schemes. We characterize $f$-perfect complexes $\mathcal{E}$ as those such that the functor $\mathcal{E} \otimes^{\mathbf{L}}_X \mathbf{L} f^*-$ preserves bounded complexes. We prove, as…
This is a manuscript of a chapter prepared for a book. The good codes possess large information length and large minimum distance. A class of codes is said to be asymptotically good if there exists a positive real $\delta$ such that, for…
Recently, much progress has been made to construct minimal linear codes due to their preference in secret sharing schemes and secure two-party computation. In this paper, we put forward a new method to construct minimal linear codes by…
We consider linear programming (LP) problems in infinite dimensional spaces that are in general computationally intractable. Under suitable assumptions, we develop an approximation bridge from the infinite-dimensional LP to tractable finite…
A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes…
In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…
In this paper, we consider finite flag-transitive affine planes with a solvable automorphism group. Under a mild number-theoretic condition involving the order and dimension of the plane, the translation complement must contain a linear…
In this paper, we present two new constructions of complex codebooks with multiplicative characters, additive characters and trace functions over finite fields, and determine the maximal cross-correlation amplitude of these codebooks. We…
Topological subsystem codes in three spatial dimensions allow for quantum error correction with no time overhead, even in the presence of measurement noise. The physical origins of this single-shot property remain elusive, in part due to…
In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic…
A finite linear space is a finite set of points and lines, where any two points lie on a unique line. Well known examples include projective planes. This project focuses on linear spaces which admit certain types of symmetries. Symmetries…
We show that the problem of computing the distance of a given permutation from a subgroup $H$ of $S_n$ is in general NP-complete, even under the restriction that $H$ is elementary Abelian of exponent 2. The problem is shown to be…