On shortening construction of self-orthogonal quaternary codes

For a given quaternary self-orthogonal (SO) code, using information of weights of codewords in the dual of the binary code generated by the supports of this SO code, one can construct new quaternary SO code by shortening method. Two methods of determining weights of codewords in the dual of the binary support code of a given large length SO code are presented. Using these methods, we construct many SO codes from a quantum 286-cap in PG(6, 4), and deduce existence of many quantum caps in PG(6, 4) and good quantum codes of distance 4.

[1]  Qing Chen,et al.  All the Stabilizer Codes of Distance 3 , 2009, IEEE Transactions on Information Theory.

[3]  Yves Edel,et al.  Recursive constructions for large caps , 1999 .

[4]  N. Sloane,et al.  Quantum error correction via codes over GF(4) , 1996, Proceedings of IEEE International Symposium on Information Theory.

[5]  Daniele Bartoli,et al.  The structure of quaternary quantum caps , 2014, Des. Codes Cryptogr..

[6]  Daniel Gottesman,et al.  Stabilizer Codes and Quantum Error Correction , 1997, quant-ph/9705052.

[7]  Daniele Bartoli,et al.  New Quantum Caps in PG(4, 4) , 2009, 0905.1059.

[8]  N. Sloane,et al.  Quantum Error Correction Via Codes Over GF , 1998 .

[9]  Vladimir D. Tonchev.  Quantum codes from caps , 2008, Discret. Math..

[10]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .