dorsal/arxiv
View SchemaConvolutional and tail-biting quantum error-correcting codes
| Authors | G. David Forney, Jr., Markus Grassl, Saikat Guha |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0511016 |
| URL | https://arxiv.org/abs/quant-ph/0511016 |
| DOI | 10.1109/TIT.2006.890698 |
| Journal | IEEE Transactions on Information Theory, vol. 53, no. 3, March 2007, pp. 865-880 |
Abstract
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.
{
"annotation_id": "6789fc87-068b-4f80-8dc7-e4481b1fc777",
"date_created": "2026-03-02T18:02:20.709000Z",
"date_modified": "2026-03-02T18:02:20.709000Z",
"file_hash": "e2f132b6cefcbc3d25d273d629b084d0befdbfeb5c5c4b76eafb8f7cf6cfafa8",
"private": false,
"record": {
"abstract": "Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to\n4096 states and minimum distances up to 10 are constructed as stabilizer codes\nfrom classical self-orthogonal rate-1/n F_4-linear and binary linear\nconvolutional codes, respectively. These codes generally have higher rate and\nless decoding complexity than comparable quantum block codes or previous\nquantum convolutional codes. Rate-(n-2)/n block stabilizer codes with the same\nrate and error-correction capability and essentially the same decoding\nalgorithms are derived from these convolutional codes via tail-biting.",
"arxiv_id": "quant-ph/0511016",
"authors": [
"G. David Forney, Jr.",
"Markus Grassl",
"Saikat Guha"
],
"categories": [
"quant-ph",
"cs.IT",
"math.IT"
],
"doi": "10.1109/TIT.2006.890698",
"journal_ref": "IEEE Transactions on Information Theory, vol. 53, no. 3, March\n 2007, pp. 865-880",
"title": "Convolutional and tail-biting quantum error-correcting codes",
"url": "https://arxiv.org/abs/quant-ph/0511016"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "fabb3583-f0fc-47fc-abc8-e237291c1650",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}