21 search results - page 2 / 5 » aaecc 2006 |
AAECC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract Dirty paper coding are relevant for wireless networks, multiuser channels, and digital watermarking. We show that the problem of dirty paper is essentially equivalent to s...
AAECC
2006
Springer
13 years 5 months ago
2006
Springer
We describe a complete algorithm to compute the hypergeometric solutions of linear recurrence relations with rational function coefficients. We use the notion of finite singularit...
AAECC
2006
Springer
13 years 5 months ago
2006
Springer
The contribution of this paper is an effective proof of the well-foundedness of MPO, as a term of the Calculus of Inductive Constructions. This proof is direct, short and simple. ...
AAECC
2006
Springer
13 years 5 months ago
2006
Springer
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(xn - 1), where F is a finite field. A particular choice of the data leads to th...
AAECC
2006
Springer
13 years 5 months ago
2006
Springer
We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to expl...