Convolutional and tail-biting quantum error-correcting codes

G. David Forney, Markus Grassl, Saikat Guha

Research output: Contribution to journalArticle

62 Scopus citations

Abstract

Rate-(n -2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to are constructed as stabilizer codes from classical self-orthogonal rate-1-/n F4 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 complexity are derived from these convolutional codes via tail-biting.

Original languageEnglish (US)
Pages (from-to)865-880
Number of pages16
JournalIEEE Transactions on Information Theory
Volume53
Issue number3
DOIs
StatePublished - Mar 1 2007
Externally publishedYes

Keywords

  • CSS-type codes
  • Quantum convolutional codes (QCCs)
  • Quantum error-correcting codes
  • Quantum tail-biting codes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Convolutional and tail-biting quantum error-correcting codes'. Together they form a unique fingerprint.

  • Cite this