A low-density parity-check code is a code specified by a parity-check matrix with the following properties : each column contains a small fixed numberj > 3 of Iâ€™s and each row contains a small fixedâ€¦ (More)

Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) [lo] servers. The inherent flexibilityâ€¦ (More)

Formulas are derived for linear (least-square) recon-<lb>struction of multidimensional (e.g., space-time) random fields from<lb>sample measurements taken over a limited region of observation.<lb>Dataâ€¦ (More)

We consider a user communicating over a fading channel with perfect channel state information. Data is assumed to arrive from some higher layer application and is stored in a buffer until it isâ€¦ (More)

The information theoretic approach and the collision resolution approach to multiaccess channels are reviewed in terms of the underlying communication problems that both are modeling. Someâ€¦ (More)

Abstruct-In honor of the twenty-fifth amdversary of Huffman coding, four new results about Huffman codes are presented. 'Ibe ffrst result shows that a binary prefix condition code is a Huffmau codeâ€¦ (More)

We show that very large bandwidths on fading multipath channels cannot be effectively utilized by spread-spectrum systems that (in a particular sense) spread the available power uniformly over bothâ€¦ (More)