Learn More
In this paper, we first construct several classes of classical Hermitian self-orthogonal maximum distance separable (MDS) codes. Through these classical codes, we are able to obtain various quantum MDS codes. It turns out that many of our quantum codes are new in the sense that the parameters of our quantum codes cannot be obtained from all previous(More)
In the present paper, we show that if the dimension of an arbitrary algebraic geometry code over a finite field of even characteristic is slightly less than n/2-g with n being the length of the code and g being the genus of the base curve, then it is equivalent to an Euclidean self-orthogonal code. Previously, such results required a strong condition on the(More)
A curve attaining the Hasse-Weil bound is called a maximal curve. Usually, classical error-correcting codes obtained from a maximal curve have good parameters. However, the quantum stabilizer codes obtained from such classical error-correcting codes via Euclidean or Hermitian self-orthogonality do not always possess good parameters. In this paper, the(More)
It has been a great challenge to construct new quantum maximum-distance-separable (MDS) codes. In particular, it is very hard to construct the quantum MDS codes with relatively large minimum distance. So far, except for some sparse lengths, all known q-ary quantum MDS codes have minimum distance ≤q/2 + 1. In this paper, we provide a construction of(More)
A linear complementary dual (LCD) code is a linear code with complimentary dual. LCD codes have been extensively studied in literature. On the other hand, maximum distance separable (MDS) codes are an important class of linear codes that have found wide applications in both theory and practice. However, little is known about MDS codes with complimentary(More)
Both MDS and Euclidean self-dual codes have theoretical and practical importance and the study of MDS self-dual codes has attracted lots of attention in recent years. In particular, determining existence of q-ary MDS self-dual codes for various lengths has been investigated extensively. The problem is completely solved for the case where q is even. The(More)
It is well known that quantum codes can be constructed through classical symplectic self-orthogonal codes. In this paper, we give a kind of Gilbert-Varshamov bound for symplectic self-orthogonal codes first and then obtain the Gilbert-Varshamov bound for quantum codes. The idea of obtaining the Gilbert-Varshamov bound for symplectic self-orthogonal codes(More)
The Reed-Muller (RM) code encoding n-variate degree-d polynomials over F q for d < q, with its evaluation on F n q , has relative distance 1 − d/q and can be list decoded from a 1 − O(d/q) fraction of errors. In this work, for d ≪ q, we give a length-efficient puncturing of such codes which (almost) retains the distance and list decodability properties of(More)
There have been various constructions of classical codes from polynomial valuations in literature [2], [7], [8], [10], [11]. In this paper, we present a construction of classical codes based on polynomial construction again. One of the features of this construction is that not only the classical codes arisen from the construction have good parameters, but(More)