Sciweavers

1060 search results - page 121 / 212
» Notes on Coding Theory
Sort
View
EUROCRYPT
1991
Springer
15 years 1 months ago
Boolean Functions Satisfying Higher Order Propagation Criteria
Boolean functions that satisfy higher order propagation criteria are studied. A complete characterization is given of the autocorrelation function and Walsh spectrum of second ord...
Bart Preneel, René Govaerts, Joos Vandewall...
AISC
2008
Springer
14 years 12 months ago
MetiTarski: An Automatic Prover for the Elementary Functions
Many inequalities involving the functions ln, exp, sin, cos, etc., can be proved automatically by MetiTarski: a resolution theorem prover (Metis) modified to call a decision proced...
Behzad Akbarpour, Lawrence C. Paulson
DAGSTUHL
2006
14 years 11 months ago
Binary Lambda Calculus and Combinatory Logic
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...
John Tromp
CORR
2010
Springer
58views Education» more  CORR 2010»
14 years 10 months ago
A calculus for costed computations
We develop a version of the picalculus Picost where channels are interpreted as resources which have costs associated with them. Code runs under the financial responsibility of own...
Matthew Hennessy
JCO
2008
98views more  JCO 2008»
14 years 9 months ago
A survey on nonadaptive group testing algorithms through the angle of decoding
Abstract Group testing, sometimes called pooling design, has been applied to a variety of problems such as blood testing, multiple access communication, coding theory, among others...
Hong-Bin Chen, Frank K. Hwang