Expander codes

Authors:
M. Sipser;D. A. Spielman
Affiliations:
Dept. of Math., MIT, Cambridge, MA, USA;Dept. of Math., MIT, Cambridge, MA, USA
Venue:
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Year:
1994

Citing 0
Cited 3

Cryptography with constant computational overhead

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Linear time decoding of regular expander codes

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Private locally decodable codes

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit routing problems arise in numerous applications, including video-servers, ...