Sciweavers

2655 search results - page 5 / 531
» LT Network Codes
Sort
View
ICISC
2007
120views Cryptology» more  ICISC 2007»
13 years 8 months ago
A Note About the Traceability Properties of Linear Codes
We characterize the traceability properties of linear codes. It is well known that any code of length n and minimum distance d is a c-TA code if c2 < n/(n−d). In this paper, w...
Marcel Fernandez, Josep Cotrina Navau, Miguel Sori...
VTC
2008
IEEE
141views Communications» more  VTC 2008»
14 years 1 months ago
Address Assignment and Routing Schemes for ZigBee-Based Long-Thin Wireless Sensor Networks
Abstract—Wireless sensor networks (WSNs) have been extensively researched recently. This paper makes two contributions to this field. First, we promote a new concept of long-thi...
Meng-Shiuan Pan, Hua-Wei Fang, Yung-Chih Liu, Yu-C...
CPC
2004
69views more  CPC 2004»
13 years 6 months ago
New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
Let C be a code of length n over an alphabet of q letters. A codeword y is called a descendant of a set of t codewords {x1 , . . . , xt } if yi {x1 i , . . . , xt i} for all i = ...
Noga Alon, Uri Stav
IWOCA
2009
Springer
193views Algorithms» more  IWOCA 2009»
14 years 1 months ago
Gray Code Compression
An n-bit (cyclic) Gray code is a (cyclic) sequence of all n-bit strings such that consecutive strings differ in a single bit. We describe an algorithm which for every positive int...
Darko Dimitrov, Tomás Dvorák, Petr G...
GLOBECOM
2008
IEEE
14 years 1 months ago
Rate Adaptive Binary Erasure Quantization with Dual Fountain Codes
—In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that t...
Dino Sejdinovic, Robert J. Piechocki, Angela Doufe...