Simple rate-1/3 convolutional and tail-biting quantum error-correcting codes

G. David Forney, Saikat Guha

Research output: Contribution to journalConference articlepeer-review

13 Scopus citations

Abstract

Simple rate-1/3 single-error-correcting unrestricted and CSS-type quantum convolutional codes are constructed from classical self-orthogonal F4-linear and F2-linear convolutional codes, respectively. These quantum convolutional codes have higher rate than comparable quantum block codes or previous quantum convolutional codes, and are simple to decode. A block single-error-correcting [9, 3, 3] tail-biting code is derived from the unrestricted convolutional code, and similarly a [15, 5, 3] CSStype block code from the CSS-type convolutional code.

Original languageEnglish (US)
Article number1523495
JournalIEEE International Symposium on Information Theory - Proceedings
Volume2005-January
DOIs
StatePublished - 2005
Externally publishedYes
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: Sep 4 2005Sep 9 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Simple rate-1/3 convolutional and tail-biting quantum error-correcting codes'. Together they form a unique fingerprint.

Cite this