Convolutional and tail-biting quantum error-correcting codes

Details Convolutional and tail-biting quantum error-correcting codes Convolutional and tail-biting quantum error-correcting codes

2005-11-02

arxiv.org/abs/quant-ph/0511016v2

IEEE Transactions on Information Theory, vol. 53, no. 3, March 2007, pp. 865-880

Physics

Quantum Physics

30 pages. Submitted to IEEE Transactions on Information Theory. Minor revisions after first round of reviews

Scientific paper

10.1109/TIT.2006.890698

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.

Affiliated with

Also associated with

No associations

Rating

Convolutional and tail-biting quantum error-correcting codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Convolutional and tail-biting quantum error-correcting codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convolutional and tail-biting quantum error-correcting codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-483359