DocumentCode
2023877
Title
Quantum Convolutional Codes Derived from Generalized Reed-Solomon Codes
Author
Aly, S.A. ; Klappenecker, A. ; Sarvepalli, P.K.
Author_Institution
Texas A&M Univ., College Station
fYear
2007
fDate
24-29 June 2007
Firstpage
821
Lastpage
825
Abstract
Convolutional stabilizer codes promise to make quantum communication more reliable with attractive online encoding and decoding algorithms. This paper introduces a new approach to convolutional stabilizer codes based on direct limit constructions. A quantum Singleton bound for pure convolutional stabilizer codes is given. A familiy of quantum convolutional codes is derived from generalized Reed-Solomon codes. These codes are shown to be optimal with respect to the (quantum) Singleton bound.
Keywords
Reed-Solomon codes; convolutional codes; quantum communication; convolutional stabilizer codes; generalized Reed-Solomon codes; quantum communication; quantum convolutional codes; Block codes; Computer science; Convolutional codes; Decoding; Encoding; Polynomials; Protection; Quantum computing; Quantum mechanics; Reed-Solomon codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location
Nice
Print_ISBN
978-1-4244-1397-3
Type
conf
DOI
10.1109/ISIT.2007.4557326
Filename
4557326
Link To Document