Sciweavers

TIT
2010
90views Education» more  TIT 2010»
12 years 11 months ago
Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels
Typical minimum distances and error exponents are analyzed on the 8-PSK Gaussian channel for two capacityachieving code ensembles with different algebraic structure. It is proved t...
Giacomo Como
TSP
2008
87views more  TSP 2008»
13 years 4 months ago
Interference Suppression for Memoryless Nonlinear Multiuser Systems Using Constellation Structure
A generalized concept of interference suppression is introduced for multiuser systems with a known memoryless transmit non-linearity, such as in the downlink amplifier of a satelli...
Ananya Sen Gupta, Andrew Singer
CORR
2007
Springer
87views Education» more  CORR 2007»
13 years 4 months ago
Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
Animashree Anandkumar, Lang Tong, Ananthram Swami
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 4 months ago
Asymptotically Optimum Universal One-Bit Watermarking for Gaussian Covertexts and Gaussian Attacks
The problem of optimum watermark embedding and detection was addressed in a recent paper by Merhav and Sabbag, where the optimality criterion was the maximum false
Pedro Comesaña, Neri Merhav, Mauro Barni
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 4 months ago
High-Rate Quantization for the Neyman-Pearson Detection of Hidden Markov Processes
This paper investigates the decentralized detection of Hidden Markov Processes using the NeymanPearson test. We consider a network formed by a large number of distributed sensors....
Joffrey Villard, Pascal Bianchi, Eric Moulines, Pa...
DCC
2007
IEEE
14 years 3 months ago
Bayesian Detection in Bounded Height Tree Networks
We study the detection performance of large scale sensor networks, configured as trees with bounded height, in which information is progressively compressed as it moves towards th...
Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win