1400 search results - page 141 / 280 » On multiplication in finite fields |
ISSAC
1995
Springer
14 years 17 days ago
1995
Springer
We present an efficient algorithm for testing whether a given integral polynomial has two distinct roots a, B such that fflp is a root of unity. The test is based on results obtai...
DAC
2003
ACM
14 years 2 months ago
2003
ACM
This paper presents an analytical framework for the implementation of digital infinite impulse response filters in fixed-point hardware on field programmable gate arrays. This ana...
ECCC
2010
13 years 6 months ago
2010
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
SIAMNUM
2010
13 years 3 months ago
2010
In this paper we introduce a new class of diffeomorphic smoothers based on general spline smoothing techniques and on the use of some tools that have been recently developed in th...