Learn More
Recently, symbol-pair codes are proposed to protect against pair errors in symbol-pair read channels. One main task in symbol-pair coding theory is to design codes with large minimum pair distance. Maximum distance separable (MDS) symbol-pair codes are optimal in the sense they attain maximal minimum pair distance. In this paper, based on constacyclic(More)
Let <i>q</i> be an odd prime power. Based on classical negacyclic codes, we construct two classes of quantum maximum-distance-separable (MDS) codes with parameters [[<i>q</i><sup>2</sup>+1, <i>q</i><sup>2</sup>-2<i>d</i>+3, <i>d</i>]]<i>q</i> where <i>q</i> &#x2261; 1 (mod 4) and 2 &#x2264; <i>d</i> &#x2264; <i>q</i>+1 is even, and(More)
One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. Quantum maximal distance separable (MDS) codes are optimal in the sense they attain maximal minimum distance. Recently, constructing quantum MDS codes has received much attention and seems to become more and more difficult. In this paper, based on(More)