Quantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller Codes
arXiv:quant-ph/0701037
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. Two families of quantum convolutional codes are derived from generalized Reed-Solomon codes and from Reed- Muller codes. A Singleton bound for pure convolutional stabilizer codes is given.
5 pages; updated parameters of classical (whence quantum) RM convolutional codes
References in corpus (7)
- On optimal quantum codes
- Description of a quantum convolutional code
- Convolutional and tail-biting quantum error-correcting codes
- Quantum convolutional codes: fundamentals
- Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes
- Quantum Block and Convolutional Codes from Self-orthogonal Product Codes
- Simple Rate-1/3 Convolutional and Tail-Biting Quantum Error-Correcting Codes
Cited by in corpus (7)
- Quantum Coding with Entanglement
- A Construction of MDS Quantum Convolutional Codes
- New Convolutional Codes Derived from Algebraic Geometry Codes
- Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes
- On Quantum and Classical Error Control Codes: Constructions and Applications
- Examples of minimal-memory, non-catastrophic quantum convolutional encoders
- Asymmetric quantum convolutional codes