相关论文: On binary constructions of quantum codes
The main theorem in this paper is a far-reaching generalization of Gleason's theorem on the weight enumerators of codes which applies to arbitrary-genus weight enumerators of self-dual codes defined over a large class of finite rings and…
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…
In this expository paper we show how one can, in a uniform way, calculate the weight distributions of some well-known binary cyclic codes. The codes are related to certain families of curves, and the weight distributions are related to the…
We use the relations between quadrics, trace codes and algebraic curves to construct algebraic curves over finite fields with many points and to compute generalized Hamming weights of codes.
Weighted graph states are a natural generalization of graph states, which are generated by applying controlled-phase gates, instead of controlled-Z gates, to a separable state. In this paper, we show that uniformly weighted graph states on…
Generalized bicycle (GB) codes have emerged as a promising class of quantum error-correcting codes with practical decoding capabilities. While numerous asymptotically good quantum codes and quantum low-density parity-check code…
We elaborate on the notion of generalized tomograms, both in the classical and quantum domains. We construct a scheme of star-products of thick tomographic symbols and obtain in explicit form the kernels of classical and quantum generalized…
Quantum error correction is rapidly seeing first experimental implementations, but there is a significant gap between asymptotically optimal error-correcting codes and codes that are experimentally feasible. Quantum LDPC codes range from…
A statistical estimation algorithm of the weight distribution of a linear code is shown, based on using its generator matrix as a compression function on random bit strings.
Linear codes with a few weights can be applied to communication, consumer electronics and data storage system. In addition, the weight hierarchy of linear codes has many applications such as on the type II wire-tap channel, dealing with…
Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight…
Some combinatorial designs, such as Hadamard matrices, have been extensively researched and are familiar to readers across the spectrum of Science and Engineering. They arise in diverse fields such as cryptography, communication theory, and…
Based on cyclic simplex codes, a new construction of a family of 2-generator quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208,…
We characterize the affine-invariant maximal extended cyclic codes. Then by the CSS construction, we derive from these codes a family of pure quantum codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes is derived…
It is known that for binary codes one can use Gr\"obner bases to obtain a subset of codewords of minimal support that can be used to determine the second generalized Hamming weight of the code. In this paper we establish conditions on a…
We introduce a new "positive formalism" for encoding quantum theories in the general boundary formulation, somewhat analogous to the mixed state formalism of the standard formulation. This makes the probability interpretation more natural…
The basic features of the complex canonical formulation of general relativity and the recent developments in the quantum gravity program based on it are reviewed. The exposition is intended to be complementary to the review articles…
We introduce a formula for determining the number of codewords of weight 2 in cyclic codes and provide results related to the count of codewords with weight 3. Additionally, we establish a recursive relationship for binary cyclic codes that…
Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical…
We construct a class of three-Lee-weight and two infinite families of five-Lee-weight codes over the ring $R=\mathbb{F}_2 +v\mathbb{F}_2 +v^2\mathbb{F}_2 +v^3\mathbb{F}_2 +v^4\mathbb{F}_2,$ where $v^5=1.$ The same ring occurs in the quintic…