Sciweavers

1060 search results - page 82 / 212
» Notes on Coding Theory
Sort
View
POPL
2012
ACM
13 years 5 months ago
Algebraic foundations for effect-dependent optimisations
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
Ohad Kammar, Gordon D. Plotkin
CP
2009
Springer
15 years 10 months ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...
SARA
2009
Springer
15 years 4 months ago
Modelling Equidistant Frequency Permutation Arrays in Constraints
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightin...
PLDI
1997
ACM
15 years 2 months ago
Two for the Price of One: Composing Partial Evaluation and Compilation
One of the flagship applications of partial evaluation is compilation and compiler generation. However, partial evaluation is usually expressed as a source-to-source transformati...
Michael Sperber, Peter Thiemann
FOCS
1995
IEEE
15 years 1 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan