Convolutional and Tail-Biting Quantum Error-Correcting Codes

From MaRDI portal
Publication:3548138

DOI10.1109/TIT.2006.890698zbMATH Open1214.81065arXivquant-ph/0511016OpenAlexW2134208807MaRDI QIDQ3548138FDOQ3548138


Authors: M. Grassl, Saikat Guha, G. David jun. Forney Edit this on Wikidata


Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/quant-ph/0511016




Recommendations




Cited In (19)

Uses Software





This page was built for publication: Convolutional and Tail-Biting Quantum Error-Correcting Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548138)