相关论文: From primary to dual affine variety codes over the…

Hybrid codes simultaneously encode both quantum and classical information into physical qubits. We give several general results about hybrid codes, most notably that the quantum codes comprising a genuine hybrid code must be impure and that…

In this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that property by means of computations of some divisors of a…

The main outcomes of the paper are divided into two parts. First, we present a new dual for quadratic programs, in which, the dual variables are affine functions, and we prove strong duality. Since the new dual is intractable, we consider a…

We study additive quaternary codes whose parameters are close to those of the extended cyclic [12; 6; 6]4-code or to the quaternary linear codes generated by the elliptic quadric in PG(3; 4) or its dual. In particular we characterize those…

In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…

In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family…

We introduce self-dual codes over the Kleinian four group $K = \mathbb{Z}_2 \times \mathbb{Z}_2$ for a natural quadratic form on $K^n$ and develop the theory. Topics studied are: weight enumerators, mass formulas, classification up to…

The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…

We propose a method for constructing quantum error-correcting codes based on non-binary low-density parity-check codes with Tanner graph girth 16. While conventional constructions using circulant permutation matrices are limited to girth…

Quantum error avoiding codes are constructed by exploiting a geometric interpretation of the algebra of measurements of an open quantum system. The notion of a generalized Dirac operator is introduced and used to naturally construct…

Multi-twisted (MT) codes were introduced as a generalization of quasi-twisted (QT) codes. QT codes have been known to contain many good codes. In this work, we show that codes with good parameters and desirable properties can be obtained…

Toric codes are a class of $m$-dimensional cyclic codes introduced recently by J. Hansen. They may be defined as evaluation codes obtained from monomials corresponding to integer lattice points in an integral convex polytope $P \subseteq…

An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…

We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult…

We study the functional codes of second order defined by G. Lachaud on $\mathcal{X} \subset {\mathbb{P}}^4(\mathbb{F}_q)$ a quadric of rank($\mathcal{X}$)=3,4,5 or a non-degenerate hermitian variety. We give some bounds for %$#…

Let $(\mathbf{U}, \mathbf{U}^\imath)$ be a split affine quantum symmetric pair of type $\mathsf{B}_n^{(1)}, \mathsf{C}_n^{(1)}$ or $\mathsf{D}_n^{(1)}$. We prove factorization and coproduct formulae for the Drinfeld-Cartan operators…

We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary…

It has been widely observed that there exists a fundamental trade-off between the minimum (Hamming) distance properties and the iterative decoding convergence behavior of turbo-like codes. While capacity achieving code ensembles typically…

Good quantum codes, such as quantum MDS codes, are typically nondegenerate, meaning that errors of small weight require active error-correction, which is--paradoxically--itself prone to errors. Decoherence free subspaces, on the other hand,…

We find a two-parameter family of ordinary differential systems in dimension five with the affine Weyl group symmetry of type $D_3^{(2)}$. We show its symmetry and holomorphy conditions. This is the second example which gave higher order…