Convolutional and tail-biting quantum error-correcting codes
<|reference_start|>Convolutional and tail-biting quantum error-correcting codes: 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.<|reference_end|>
@article{forney,2005convolutional,
    title={Convolutional and tail-biting quantum error-correcting codes},
    author={G. David Forney, Jr., Markus Grassl, and Saikat Guha},
    journal={IEEE Transactions on Information Theory, vol. 53, no. 3, March
  2007, pp. 865-880},
    year={2005},
    doi={10.1109/TIT.2006.890698},
    archivePrefix={arXiv},
    eprint={quant-ph/0511016},
    primaryClass={quant-ph cs.IT math.IT}
}