Sciweavers

43 search results - page 3 / 9
» Arithmetic completely regular codes
Sort
View
ENTCS
2006
114views more  ENTCS 2006»
13 years 5 months ago
Synthesis of Mealy Machines Using Derivatives
In Rutten [13] the theoretical basis was given for the synthesis of binary Mealy machines from specifications in 2-adic arithmetic. This construction is based on the symbolic comp...
Helle Hvid Hansen, David Costa, Jan J. M. M. Rutte...
ARSCOM
2002
69views more  ARSCOM 2002»
13 years 5 months ago
On Deuber's partition theorem for (m, p, c)-sets
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...
David S. Gunderson
AMAI
2004
Springer
13 years 9 months ago
Using Logic Programs to Reason about Infinite Sets
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Those programs assert code...
Douglas A. Cenzer, V. Wiktor Marek, Jeffrey B. Rem...
SCOPES
2004
Springer
13 years 10 months ago
DSP Code Generation with Optimized Data Word-Length Selection
Digital signal processing applications are implemented in embedded systems with fixed-point arithmetic to minimize the cost and the power consumption. To reduce the application ti...
Daniel Menard, Olivier Sentieys
FSE
1997
Springer
81views Cryptology» more  FSE 1997»
13 years 9 months ago
XMX: A Firmware-Oriented Block Cipher Based on Modular Multiplications
Abstract. This paper presents xmx, a new symmetric block cipher optimized for public-key libraries and microcontrollers with arithmetic coprocessors. xmx has no S-boxes and uses on...
David M'Raïhi, David Naccache, Jacques Stern,...