58 search results - page 3 / 12 » On the Generalized Linear Equivalence of Functions Over Fini... |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
TC
2002
13 years 7 months ago
2002
We present a new multivariate interpolation algorithm over arbitrary fields which is primarily suited for small finite fields. Given function values at arbitrary t points, we show ...
AUTOMATICA
2002
13 years 7 months ago
2002
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
DCC
2002
IEEE
14 years 7 months ago
2002
IEEE
We use methods of Mortimer [19] to examine the subcodes spanned by minimumweight vectors of the projective generalized Reed-Muller codes and their duals. These methods provide a p...
SETA
2004
Springer
14 years 21 days ago
2004
Springer
We study algebraic feedback shift registers (AFSRs) based on quotients of polynomial rings in several variables over a finite field. These registers are natural generalizations o...