activity
20002008
most citedQuantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller Codes

16 citations · 66 across the 12 of their papers we have counts for

collaborators
Showing 2007Show all

5 papers · 1 filter

cs.IT200715 cited

Bounds on the Network Coding Capacity for Wireless Random Networks

Salah A. Aly, Vishal Kapoor, Jie Meng +1

Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic model for…

quant-ph20071 cited

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…

cs.IT20079 cited

Network Coding Capacity of Random Wireless Networks under a Signal-to-Interference-and-Noise Model

Zhenning Kong, Salah A. Aly, Emina Soljanin +2

In this paper, we study network coding capacity for random wireless networks. Previous work on network coding capacity for wired and wireless networks have focused on the case wher…

quant-ph200716 cited

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…

cs.IT2007

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.…