56 citations · 449 across the 44 of their papers we have counts for
4 papers · 1 filter
Asymptotics of the quantum Hamming bound for subsystem codes
Andreas Klappenecker, Pradeep Kiran Sarvepalli
Ashikhmin and Litsyn showed that all binary stabilizer codes - pure or impure - of sufficiently large length obey the quantum Hamming bound, ruling out the possibility that impure…
On Subsystem Codes Beating the Hamming or Singleton Bound
Andreas Klappenecker, Pradeep Kiran Sarvepalli
Subsystem codes are a generalization of noiseless subsystems, decoherence free subspaces, and quantum error-correcting codes. We prove a Singleton bound for GF(q)-linear subsystem…
Quantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller Codes
Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli
Convolutional stabilizer codes promise to make quantum communication more reliable with attractive online encoding and decoding algorithms. This paper introduces a new approach to…
Duadic Group Algebra Codes
Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli
Duadic group algebra codes are a generalization of quadratic residue codes. This paper settles an open problem raised by Zhu concerning the existence of duadic group algebra codes.…