Sciweavers

495 search results - page 25 / 99
» Capacity of Non-Malleable Codes
Sort
View
GLOBECOM
2009
IEEE
13 years 6 months ago
Coding Strategies for Bidirectional Relaying for Arbitrarily Varying Channels
In this work we study optimal coding strategies for bidirectional relaying under the condition of arbitrarily varying channels. We consider a three-node network where a relay node ...
Rafael F. Wyrembelski, Igor Bjelakovic, Holger Boc...
TWC
2010
13 years 3 months ago
Rateless coding for hybrid free-space optical and radio-frequency communication
Abstract--Free-space optical (FSO) transmission systems enable high-speed communication with relatively small deployment costs. However, FSO suffers a critical disadvantage, namely...
Ali AbdulHussein, Anand Oka, Trung Thanh Nguyen 00...
INFOCOM
2010
IEEE
13 years 7 months ago
Incorporating Random Linear Network Coding for Peer-to-Peer Network Diagnosis
—Recent studies show that network coding improves multicast session throughput. In this paper, we demonstrate how random linear network coding can be incorporated to provide netw...
Elias Kehdi, Baochun Li
CORR
2010
Springer
67views Education» more  CORR 2010»
13 years 6 months ago
Secret Sharing LDPC Codes for the Constrained Gaussian Wiretap Channel
The problem of secret sharing over the Gaussian wiretap channel is considered. A source and a destination intend to share secret information over a Gaussian channel in the presenc...
Chan Wong Wong, Tan F. Wong, John M. Shea
EMNLP
2010
13 years 7 months ago
Practical Linguistic Steganography Using Contextual Synonym Substitution and Vertex Colour Coding
Linguistic Steganography is concerned with hiding information in natural language text. One of the major transformations used in Linguistic Steganography is synonym substitution. ...
Ching-Yun Chang, Stephen Clark