Sciweavers

495 search results - page 9 / 99
» Capacity of Non-Malleable Codes
Sort
View
ICC
2009
IEEE
135views Communications» more  ICC 2009»
13 years 7 months ago
A Discrete Channel Model for Capturing Memory and Soft-Decision Information: A Capacity Study
A discrete (binary-input 2q -ary output) communication channel with memory is introduced with the objective to judiciously capture both the statistical memory and the soft-decision...
Cecilio Pimentel, Fady Alajaji
TIT
2011
109views more  TIT 2011»
13 years 4 months ago
On Achieving Local View Capacity Via Maximal Independent Graph Scheduling
—“If we know more, we can achieve more.” This adage also applies to networks, where more information about the network state translates into higher sum-rates. In this paper, ...
Vaneet Aggarwal, Amir Salman Avestimehr, Ashutosh ...
PRL
2007
107views more  PRL 2007»
13 years 9 months ago
Robust SS watermarking with improved capacity
Robustness is a key attribute of spread spectrum (SS) watermarking scheme. It is significantly deteriorated if one tries to achieve high embedding rate keeping other parameters u...
Santi P. Maity, Malay K. Kundu, Tirtha S. Das
TIT
2008
105views more  TIT 2008»
13 years 9 months ago
Network Coding Capacity With a Constrained Number of Coding Nodes
Abstract-- We study network coding capacity under a constraint on the total number of network nodes that can perform coding. That is, only a certain number of network nodes can pro...
Jillian Cannons, Kenneth Zeger
TIT
2011
148views more  TIT 2011»
13 years 4 months ago
On Two-User Gaussian Multiple Access Channels With Finite Input Constellations
—Constellation Constrained (CC) capacity regions of two-user Single-Input Single-Output (SISO) Gaussian Multiple Access Channels (GMAC) are computed for several Non-Orthogonal Mu...
Jagadeesh Harshan, Bikash Sundar Rajan