After the pioneering work of Shor and Steane, we are able to establish links between quantum codes and classical codes with certain self-orthogonality. Therefore, constructing classical self-orthogonal codes with small dimension and large dual distance becomes our centre point due to the interesting application to quantum codes. One of the most interesting and useful families of classical codes are MDS codes. We will show a systematic construction for classical Hermitian self-orthogonal MDS codes through generalized Reed-Solomn codes. Afterwards, new families of quantum MDS codes can be produced. Classical BCH codes would be another good choice for self-orthogonal codes. We show the dual containment through polynomial evalua...
It is shown that the row spaces of certain generalized weighing matrices, Bhaskar Rao designs, and g...
Quantum maximum-distance-separable (MDS) codes form an important class of quantum codes. To get q-ar...
Producción CientíficaWe introduce a new class of evaluation linear codes by evaluating polynomials a...
AbstractSubcodes of some known maximal self-orthogonal codes and optimal self-dual codes of length n...
We give sufficient conditions for self-orthogonality with respect to symplec- tic, Euclidean and He...
In this paper, we take advantage of a class of one-generator generalized quasi-cyclic (GQC) codes of...
In this paper, we take advantage of a class of one-generator generalized quasi-cyclic (GQC) codes of...
Many q-ary stabilizer quantum codes can be constructed from Hermitian self-orthogonal q2-ary linear ...
We present new quantum codes with good parameters which are constructed from self-orthogonal algebra...
In this work, we determine self dual and self orthogonal codes arising from constacyclic codes over ...
It is proved that a class of q-ary (2n,n) formally self-dual codes obtained from symmetric matrices ...
We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suit...
It is proved that a class of q-ary (2n,n) formally self-dual codes obtained from symmetric matrices ...
It is proved that a class of q-ary (2n,n) formally self-dual codes obtained from symmetric matrices ...
AbstractSubcodes of some known maximal self-orthogonal codes and optimal self-dual codes of length n...
It is shown that the row spaces of certain generalized weighing matrices, Bhaskar Rao designs, and g...
Quantum maximum-distance-separable (MDS) codes form an important class of quantum codes. To get q-ar...
Producción CientíficaWe introduce a new class of evaluation linear codes by evaluating polynomials a...
AbstractSubcodes of some known maximal self-orthogonal codes and optimal self-dual codes of length n...
We give sufficient conditions for self-orthogonality with respect to symplec- tic, Euclidean and He...
In this paper, we take advantage of a class of one-generator generalized quasi-cyclic (GQC) codes of...
In this paper, we take advantage of a class of one-generator generalized quasi-cyclic (GQC) codes of...
Many q-ary stabilizer quantum codes can be constructed from Hermitian self-orthogonal q2-ary linear ...
We present new quantum codes with good parameters which are constructed from self-orthogonal algebra...
In this work, we determine self dual and self orthogonal codes arising from constacyclic codes over ...
It is proved that a class of q-ary (2n,n) formally self-dual codes obtained from symmetric matrices ...
We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suit...
It is proved that a class of q-ary (2n,n) formally self-dual codes obtained from symmetric matrices ...
It is proved that a class of q-ary (2n,n) formally self-dual codes obtained from symmetric matrices ...
AbstractSubcodes of some known maximal self-orthogonal codes and optimal self-dual codes of length n...
It is shown that the row spaces of certain generalized weighing matrices, Bhaskar Rao designs, and g...
Quantum maximum-distance-separable (MDS) codes form an important class of quantum codes. To get q-ar...
Producción CientíficaWe introduce a new class of evaluation linear codes by evaluating polynomials a...