Sciweavers

370 search results - page 67 / 74
» tits 2008
Sort
View
TIT
1998
90views more  TIT 1998»
13 years 7 months ago
On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
Amir H. Banihashemi, Amir K. Khandani
TIT
1998
112views more  TIT 1998»
13 years 7 months ago
Application of Network Calculus to Guaranteed Service Networks
—We use recent network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of resu...
Jean-Yves Le Boudec
TIT
1998
93views more  TIT 1998»
13 years 7 months ago
Detection Techniques for Fading Multipath Channels with Unresolved Components
— In this paper we consider noncoherent detection structures for multipath Ricean/Rayleigh fading channels. The multipath components are assumed to be unresolved, with known dela...
Florence Danilo, Harry Leib
TIT
1998
216views more  TIT 1998»
13 years 7 months ago
Data Compression and Harmonic Analysis
In this article we review some recent interactions between harmonic analysis and data compression. The story goes back of course to Shannon’s R(D) theory in the case of Gaussian...
David L. Donoho, Martin Vetterli, Ronald A. DeVore...
TIT
1998
73views more  TIT 1998»
13 years 7 months ago
Subspace Subcodes of Reed-Solomon Codes
— In this paper we introduce a class of nonlinear cyclic error-correcting codes, which we call subspace subcodes of Reed–Solomon (SSRS) codes. An SSRS code is a subset of a par...
Masayuki Hattori, Robert J. McEliece, Gustave Solo...