Sciweavers

73 search results - page 9 / 15
» Low density codes achieve the rate-distortion bound
Sort
View
INFOCOM
2010
IEEE
14 years 8 months ago
Bargaining and Price-of-Anarchy in Repeated Inter-Session Network Coding Games
— Most of the previous work on network coding has assumed that the users are not selfish and always follow the designed coding schemes. However, recent results have shown that s...
Amir Hamed Mohsenian Rad, Jianwei Huang, Vincent W...
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 4 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
ICASSP
2011
IEEE
14 years 1 months ago
A methodology based on Transportation problem modeling for designing parallel interleaver architectures
For high-data-rate applications, turbo-like iterative decoders are implemented with parallel hardware architecture. However, to achieve high throughput, concurrent accesses to each...
Awais Sani, Philippe Coussy, Cyrille Chavet, Eric ...
SECON
2007
IEEE
15 years 4 months ago
INPoD: In-Network Processing over Sensor Networks based on Code Design
—In this paper, we develop a joint Network Coding (NC)-channel coding error-resilient sensor-network approach that performs In-Network Processing based on channel code Design (IN...
Kiran Misra, Shirish S. Karande, Hayder Radha
MOBIHOC
2005
ACM
15 years 9 months ago
On the node-scheduling approach to topology control in ad hoc networks
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
Budhaditya Deb, Badri Nath