• Publications
  • Influence
Low-density parity-check codes
  • R. Gallager
  • Mathematics, Computer Science
  • IRE Trans. Inf. Theory
  • 1962
A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length. Expand
Information Theory and Reliable Communication
Communication Systems and Information Theory. A Measure of Information. Coding for Discrete Sources. Discrete Memoryless Channels and Capacity. The Noisy-Channel Coding Theorem. Techniques for CodingExpand
A generalized processor sharing approach to flow control in integrated services networks: the single-node case
Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments. Expand
Data Networks
Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages. AlsoExpand
Data networks (2nd ed.)
A generalized processor sharing approach to flow control in integrated services networks-the single node case
The authors propose the use of a packet service discipline at the nodes of the network that is based on a multiplex scheme called generalized processor sharing (GPS) that is combined with leaky bucket rate admission control to provide flexible, efficient and fair use of the links. Expand
A Distributed Algorithm for Minimum-Weight Spanning Trees
A distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph with distinct edge weights that can be initiated spontaneously at any node or at any subset of nodes. Expand
A simple derivation of the coding theorem and some applications
  • R. Gallager
  • Computer Science, Mathematics
  • IEEE Trans. Inf. Theory
  • 1965
Both amplitude-discrete and amplitude-continuous channels are treated, both with and without input constraints, and the exponential behavior of the bounds with block length is the best known for all transmission rates between 0 and capacity. Expand
Discrete Stochastic Processes
This chapter discusses Markov Chains with Countably Infinite State Spaces, Random Walks and Martingales, and Discrete State Markov Processes, all of which apply to the Renewal Processes. Expand