Sciweavers

495 search results - page 40 / 99
» Capacity of Non-Malleable Codes
Sort
View
TIP
1998
122views more  TIP 1998»
13 years 8 months ago
An error resilient scheme for image transmission over noisy channels with memory
Abstract— This correspondence addresses the use of a joint sourcechannel coding strategy for enhancing the error resilience of images transmitted over a binary channel with addit...
Philippe Burlina, Fady Alajaji
MOBIHOC
2007
ACM
14 years 8 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
MOBICOM
2003
ACM
14 years 2 months ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas
HOTOS
2003
IEEE
14 years 2 months ago
Palimpsest: Soft-Capacity Storage for Planetary-Scale Services
Distributed writable storage systems typically provide NFS-like semantics and unbounded persistence for files. We claim that for planetary-scale distributed services such facilit...
Timothy Roscoe, Steven Hand
CIC
2006
103views Communications» more  CIC 2006»
13 years 10 months ago
Performance Analysis of Punctured Turbo Code under An AWGN Channel
Turbo code is a coding technique that enhances a reliable data transmission. Because of special structure of encoder and iterative decoder, it could obtain 1dB at low EbN0 db that...
Ya-Fen Chen, Cheng-Ying Yang