Sciweavers

TIT
2008
61views more  TIT 2008»
13 years 11 months ago
Performance of Space-Time Codes: Gallager Bounds and Weight Enumeration
Since the standard union bound for space-time codes may diverge in quasi-static fading channels, the limit-before-average technique has been exploited to derive tight performance b...
Cong Ling, Kwok H. Li, Alex ChiChung Kot
TIT
2008
74views more  TIT 2008»
13 years 11 months ago
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...
Vince Grolmusz
TIT
2008
134views more  TIT 2008»
13 years 11 months ago
Communication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis
In a multiple-antenna system with two transmitters and two receivers, a scenario of data communication, known as the X channel, is studied in which each receiver receives data from...
Mohammad Ali Maddah-Ali, Abolfazl S. Motahari, Ami...
TIT
2008
97views more  TIT 2008»
13 years 11 months ago
Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets
The problem of predicting a sequence x ; x ; . . . generated by a discrete source with unknown statistics is considered. Each letter x is predicted using the information on the wor...
Boris Ryabko, Jaakko Astola, Alexander Gammerman
TIT
2008
110views more  TIT 2008»
13 years 11 months ago
Optimal Cross-Layer Scheduling of Transmissions Over a Fading Multiaccess Channel
We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the mediu...
Munish Goyal, Anurag Kumar, Vinod Sharma
TIT
2008
83views more  TIT 2008»
13 years 11 months ago
Hard Problems of Algebraic Geometry Codes
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
Qi Cheng
TIT
2008
106views more  TIT 2008»
13 years 11 months ago
Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
This article describes new theoretical results concerning the general behavior of a Feedback with Carry Shift Register (FCSR) automaton. They help to better understand how the init...
François Arnault, Thierry P. Berger, Marine...
TIT
2008
73views more  TIT 2008»
13 years 11 months ago
L-CAMP: Extremely Local High-Performance Wavelet Representations in High Spatial Dimension
A new wavelet-based methodology for representing data on regular grids is introduced and studied. The main attraction of this new L-CAMP methodology is in the way it scales with th...
Youngmi Hur, Amos Ron
TIT
2008
54views more  TIT 2008»
13 years 11 months ago
Exponential Diversity Achieving Spatio-Temporal Power Allocation Scheme for Fading Channels
In this paper, we analyze optimal (in space and time) adaptive power transmission policies for fading channels when the channel-state information (CSI) at the transmitter (CSIT) an...
Vinod Sharma, Karumbu Premkumar, Raghava N. Swamy
TIT
2008
62views more  TIT 2008»
13 years 11 months ago
Diversity Embedded Space-Time Codes
Rate and diversity impose a fundamental tradeoff in wireless communication. High-rate space
Suhas N. Diggavi, A. Robert Calderbank, Sanket Dus...