Sciweavers

92 search results - page 5 / 19
» Enumeration, Construction and Random Generation of Block Cod...
Sort
View
76
Voted
GPCE
2008
Springer
14 years 10 months ago
Generating incremental implementations of object-set queries
High-level query constructs help greatly improve the clarity of programs and the productivity of programmers, and are being introduced to increasingly more languages. However, the...
Tom Rothamel, Yanhong A. Liu
FOCS
2007
IEEE
15 years 3 months ago
Lower Bounds on Signatures From Symmetric Primitives
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
Boaz Barak, Mohammad Mahmoody-Ghidary
75
Voted
CORR
2006
Springer
142views Education» more  CORR 2006»
14 years 9 months ago
Decentralized Erasure Codes for Distributed Networked Storage
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
Alexandros G. Dimakis, Vinod M. Prabhakaran, Kanna...
ICSE
2007
IEEE-ACM
15 years 9 months ago
Feedback-Directed Random Test Generation
We present a technique that improves random test generation by incorporating feedback obtained from executing test inputs as they are created. Our technique builds inputs incremen...
Carlos Pacheco, Shuvendu K. Lahiri, Michael D. Ern...
81
Voted
ICC
2008
IEEE
141views Communications» more  ICC 2008»
15 years 4 months ago
Multilevel Structured Low-Density Parity-Check Codes
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
Nicholas Bonello, Sheng Chen, Lajos Hanzo