Sciweavers

1071 search results - page 209 / 215
» The Calculus of Algebraic Constructions
Sort
View
CSREASAM
2003
13 years 11 months ago
Randomized Traitor Tracing Algorithms for Broadcast Security
We introduce and analyze a randomized traitor tracing algorithm for broadcast security. This algorithm is very efficient compared to brute force methods (the mean time it takes is...
Simon McNicol, Serdar Boztas
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 9 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
CC
2007
Springer
123views System Software» more  CC 2007»
13 years 9 months ago
An Improved Analysis of Linear Mergers
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
Zeev Dvir, Amir Shpilka
TIT
2010
136views Education» more  TIT 2010»
13 years 4 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
DAC
2007
ACM
14 years 10 months ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
Ajay K. Verma, Philip Brisk, Paolo Ienne