152 search results - page 3 / 31 » Full Abstraction for Reduced ML |
CORR
2007
Springer
13 years 8 months ago
2007
Springer
— ”Extended Clifford algebras” are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two speci...
ICFP
1999
ACM
14 years 23 days ago
1999
ACM
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract— In this paper, collocated and distributed spacetime block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case...
FPCA
1989
14 years 15 days ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
AES
2000
Springer
14 years 24 days ago
2000
Springer
Abstract. In this paper, we discuss ways to attack various reducedround variants of MARS. We consider cryptanalysis of two reducedround variants of MARS: MARS with the full mixing ...