Distributed estimation of an unknown signal is a common task in sensor networks. The scenario usually envisioned consists of several nodes, each making an observation correlated wi...
Abstract--For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systems show no improvements in their error expon...
This paper gives an information theoretic approach for detecting Byzantine modifications in networks employing random linear network coding. Each exogenous source packet is augmen...
Tracey Ho, Ben Leong, Ralf Koetter, Muriel M&eacut...
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
This paper presents a quasi-random approach to space-time (ST) codes. The basic principle is conceptually simple, yet still very effective and flexible regarding the transmission ...
A popular way to measure the degree of dependence between two random objects is by their mutual information, defined as the divergence between the joint and product-of-marginal dis...
Abstract--Following the discovery of a fundamental connection between information measures and estimation measures in Gaussian channels, this paper explores the counterpart of thos...
Abstract--For broadcast channels, a power allocation scheme is proposed to maximize the number of active receivers, for each of which, a minimum rate Rmin > 0 can be achieved. U...
Hengameh Keshavarz, Liang-Liang Xie, Ravi R. Mazum...