Sciweavers

76 search results - page 7 / 16
» tit 1998
Sort
View
TIT
1998
79views more  TIT 1998»
14 years 9 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård
TIT
1998
81views more  TIT 1998»
14 years 9 months ago
Fast Iterative Coding Techniques for Feedback Channels
Abstract—A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noisel...
James M. Ooi, Gregory W. Wornell
TIT
1998
101views more  TIT 1998»
14 years 9 months ago
Information Theory and Communication Networks: An Unconsummated Union
—Information theory has not yet had a direct impact on networking, although there are similarities in concepts and methodologies that have consistently attracted the attention of...
Anthony Ephremides, Bruce E. Hajek
TIT
1998
77views more  TIT 1998»
14 years 9 months ago
Density Estimation from an Individual Numerical Sequence
— This paper considers estimation of a univariate density from an individual numerical sequence. It is assumed that 1) the limiting relative frequencies of the numerical sequence...
Andrew B. Nobel, Gusztáv Morvai, Sanjeev R....
TIT
1998
108views more  TIT 1998»
14 years 9 months ago
The Capacities of Frequency-Hopped Code-Division Multiple-Access Channels
Abstract— This correspondence investigates and compares the capacities of two types of frequency-hopped code-division multiple-access (FH-CDMA) communications systems; namely, mu...
Jin G. Goh, Svetislav V. Maric