%0 Journal Article
%T Convolutional and tail-biting quantum error-correcting codes
%A G. David Forney
%A Jr.
%A Markus Grassl
%A Saikat Guha
%J Mathematics
%D 2005
%I arXiv
%R 10.1109/TIT.2006.890698
%X Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 are constructed as stabilizer codes from classical self-orthogonal rate-1/n F_4-linear and binary linear convolutional codes, respectively. These codes generally have higher rate and less decoding complexity than comparable quantum block codes or previous quantum convolutional codes. Rate-(n-2)/n block stabilizer codes with the same rate and error-correction capability and essentially the same decoding algorithms are derived from these convolutional codes via tail-biting.
%U http://arxiv.org/abs/quant-ph/0511016v2