Sciweavers

7 search results - page 2 / 2
» aaecc 1999
Sort
View
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
13 years 5 months ago
Reasoning over Networks by Symbolic Methods
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
Thomas Sturm
AAECC
1999
Springer
78views Algorithms» more  AAECC 1999»
13 years 5 months ago
Properties of Finite Response Input Sequences of Recursive Convolutional Codes
Abstract. A recursive convolutional encoder can be regarded as an innite impulse response system over the Galois Field of order 2. First, in this paper, we introduce nite response ...
Didier Le Ruyet, Hong Sun, Han Vu Thien