pith. sign in

arxiv: quant-ph/0511016 · v2 · pith:UOARZCY5new · submitted 2005-11-02 · 🪐 quant-ph · cs.IT· math.IT

Convolutional and tail-biting quantum error-correcting codes

classification 🪐 quant-ph cs.ITmath.IT
keywords codesconvolutionalquantumblockdecodinglinearraterate-
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.