|
| related topics |
| {error, code, errors} |
| {let, theorem, proof} |
| {states, state, optimal} |
| {group, space, representation} |
| {algorithm, log, probability} |
|
Quantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller
Codes
Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli
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.
- oai_identifier:
- oai:arXiv.org:quant-ph/0701037
- categories:
- quant-ph cs.IT math.IT
- comments:
- 5 pages; updated parameters of classical (whence quantum) RM
convolutional codes
- arxiv_id:
- quant-ph/0701037
- created:
- 2007-01-08
- updated:
- 2007-01-22
Full article ▸
|
|
| related documents |
| 0012111v1 |
| 0312164v1 |
| 0405183v1 |
| 0201140v1 |
| 9603022v2 |
| 0206169v2 |
| 9707049v1 |
| 0701065v2 |
| 9711062v1 |
| 0004029v1 |
| 0308151v2 |
| 9912104v1 |
| 0703061v1 |
| 9612048v1 |
| 0003070v1 |
| 0610084v1 |
| 0612052v2 |
| 0612033v1 |
| 0703193v2 |
| 0701198v1 |
| 0610251v1 |
| 0701079v1 |
| 0701054v1 |
| 0610258v1 |
| 0702143v1 |
|