Sciweavers

3852 search results - page 93 / 771
» Construction of Codes for Network Coding
Sort
View
138
Voted
STOC
2009
ACM
224views Algorithms» more  STOC 2009»
16 years 4 months ago
3-query locally decodable codes of subexponential length
Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...
Klim Efremenko
136
Voted
EMSOFT
2010
Springer
15 years 1 months ago
Semantics-preserving implementation of synchronous specifications over dynamic TDMA distributed architectures
We propose a technique to automatically synthesize programs and schedules for hard real-time distributed (embedded) systems from synchronous data-flow models. Our technique connec...
Dumitru Potop-Butucaru, Akramul Azim, Sebastian Fi...
126
Voted
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 4 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
135
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
Throughput-Delay Tradeoffs in Large-Scale MANETs with Network Coding
—This paper characterizes the throughput-delay tradeoffs in mobile ad hoc networks (MANETs) with network coding, and compares results in the situation where only replication and ...
Chi Zhang, Yuguang Fang, Xiaoyan Zhu
CRYPTO
2003
Springer
98views Cryptology» more  CRYPTO 2003»
15 years 9 months ago
A Message Authentication Code Based on Unimodular Matrix Groups
We present a new construction based on modular groups. A novel element of our construction is to embed each input into a sequence of matrices with determinant ±1, the product of w...
Matthew Cary, Ramarathnam Venkatesan