Quantum quasi-cyclic low-density parity-check codes
ICIC'09 Proceedings of the 5th international conference on Emerging intelligent computing technology and applications
On non-binary quantum BCH codes
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Hi-index | 754.84 |
A finite Gilbert-Varshamov (GV) bound for pure stabilizer (binary and nonbinary) quantum error correcting codes is presented in analogy to the GV bound for classical codes by using several enumerative results in finite unitary geometry. From this quantum GV bound we obtain several new binary quantum codes in a nonconstructive way having better parameters than the known codes.