Related papers: Self-orthogonal codes from plateaued functions and…
We construct constant-sized ensembles of linear error-correcting codes over any fixed alphabet that can correct a given fraction of adversarial erasures at rates approaching the Singleton bound arbitrarily closely. We provide several…
In this paper, we give a construction of doubly even self-orthogonal codes from quasi-symmetric designs. Further, we study orbit matrices of quasi-symmetric designs and give a construction of doubly even self-orthogonal codes from orbit…
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime power $q$, we construct some class of linear code over finite field $\mathbb{F}_q$ with defining set be the preimage of…
Construction of quantum codes and entanglement-assisted quantum codes with good parameters via classical codes is an important task for quantum computing and quantum information. In this paper, by a family of one-generator quasi-cyclic…
A family of high rate quantum error correcting codes adapted to the amplitude damping channel is presented. These codes are nonadditive and exploit self-complementarity structure to correct all first-order errors. Their rates can be higher…
Linear codes with a few weights can be applied to secrete sharing, authentication codes, association schemes and strongly regular graphs. For an odd prime power $q$, we construct a class of three-weight $\F_q$-linear codes from quadratic…
The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum…
The objective of this paper is to construct a class of linear codes with two nonzero weights and three nonzero weights by using the general trace functions, which weight distributions has been determined. These linear codes contain some…
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 investigate layer codes, a family of three-dimensional stabilizer codes that can achieve optimal scaling of code parameters and a polynomial energy barrier, as candidates for self-correcting quantum memories. First, we introduce two…
The problem of finding quantum error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are…
We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both…
We give sufficient conditions for self-orthogonality with respect to symplectic, Euclidean and Hermitian inner products of a wide family of quasi-cyclic codes of index two. We provide lower bounds for the symplectic weight and the minimum…
Complex orthogonal designs (CODs) play a crucial role in the construction of space-time block codes. Their real analog, real orthogonal designs (or equivalently, sum of squares composition formula) have a long history. Adams et al. (2011)…
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…
We expand the class of holographic quantum error correcting codes by developing the notion of block perfect tensors, a wider class that includes previously defined perfect tensors. The relaxation of this constraint opens up a range of other…
We analyze combinatorial structures which play a central role in determining spectral properties of the volume operator in loop quantum gravity (LQG). These structures encode geometrical information of the embedding of arbitrary valence…
Perfect codes are arguably the most fascinating structures in combinatorial coding theory, and their classification and weight distribution are of considerable interest. This classification also involves the analysis of some related…
In this paper, based on the nonbinary graph state, we present a systematic way of constructing good non-binary quantum codes, both additive and nonadditive, for systems with integer dimensions. With the help of computer search, which…
Random linear codes (RLCs) are well known to have nice combinatorial properties and near-optimal parameters in many different settings. However, getting explicit constructions matching the parameters of RLCs is challenging, and RLCs are…