Sciweavers

CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 11 months ago
Multigroup-Decodable STBCs from Clifford Algebras
A Space-Time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximumlikelihood decoding metric can be written as a sum of g terms such that each ...
Sanjay Karmakar, B. Sundar Rajan
CORR
2006
Springer
67views Education» more  CORR 2006»
13 years 11 months ago
Considering users' behaviours in improving the responses of an information base
: In this paper, our aim is to propose a model that helps in the efficient use of an information system by users, within the organization represented by the IS, in order to resolve...
Babajide Afolabi, Odile Thiery
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 11 months ago
Decoder Error Probability of MRD Codes
In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. Using this new concept, we derive proper...
Maximilien Gadouleau, Zhiyuan Yan
CORR
2006
Springer
225views Education» more  CORR 2006»
13 years 11 months ago
Building and displaying name relations using automatic unsupervised analysis of newspaper articles
We present a tool that, from automatically recognised names, tries to infer inter-person relations in order to present associated people on maps. Based on an in-house Named Entity...
Bruno Pouliquen, Ralf Steinberger, Camelia Ignat, ...
CORR
2006
Springer
112views Education» more  CORR 2006»
13 years 11 months ago
Lossless coding for distributed streaming sources
Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a stream...
Cheng Chang, Stark C. Draper, Anant Sahai
CORR
2006
Springer
79views Education» more  CORR 2006»
13 years 11 months ago
Source coding and channel requirements for unstable processes
Our understanding of information in systems has been based on the foundation of memoryless processes. Extensions to stable Markov and auto-regressive processes are classical. Berg...
Anant Sahai, Sanjoy K. Mitter
CORR
2006
Springer
66views Education» more  CORR 2006»
13 years 11 months ago
Coding into a source: a direct inverse Rate-Distortion theorem
Shannon proved that if we can transmit bits reliably at rates larger than the rate distortion function R(D), then we can transmit this source to within a distortion D. We answer th...
Mukul Agarwal, Anant Sahai, Sanjoy K. Mitter
CORR
2006
Springer
97views Education» more  CORR 2006»
13 years 11 months ago
Stabilization using both noisy and noiseless feedback
Abstract-- When designing a distributed control system, the system designer has a choice in how to connect the different units through communication channels. In practice, noiseles...
Anant Sahai
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 11 months ago
How to beat the sphere-packing bound with feedback
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...
Anant Sahai