43 search results - page 3 / 9 » Arithmetic completely regular codes |
131
click to vote
ENTCS
2006
15 years 3 months ago
2006
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...
110
click to vote
ARSCOM
2002
15 years 2 months ago
2002
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...
123
click to vote
AMAI
2004
Springer
15 years 6 months ago
2004
Springer
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...
108
click to vote
SCOPES
2004
Springer
15 years 8 months ago
2004
Springer
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...
110
click to vote
FSE
1997
Springer
15 years 7 months ago
1997
Springer
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...