m-applications over finite fields
نویسندگان
چکیده
منابع مشابه
Classical Wavelet Transforms over Finite Fields
This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical wavelet transforms over finite fields. It is shown that each vector defined over a finite field can be represented as...
متن کاملClassical wavelet systems over finite fields
This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...
متن کاملPolynomials over Finite Fields and Applications
Self-reciprocal irreducible monic (srim) polynomials over finite fields have been studied in the past. These polynomials can be studied in the context of quadratic transformation of irreducible polynomials over finite fields. In this talk we present the generalization of some of the results known about srim polynomials to polynomials obtained by quadratic transformation of irreducible polynomia...
متن کاملApplications of Curves over Finite Fields
The area starts with Galois and Gauss Group theory and expo nential sums were the two application areas then That tradition continues Without Chevalley groups over nite elds there would have been no structure theory of nite simple groups Weil s Riemann Hypothesis for curves over nite elds is a singular event Many error estimates in combinatorics derive from it Research in nite elds requires com...
متن کاملApplications of Polynomials over Finite Fields
A most efficient way of investigating combinatorially defined point sets in spaces over finite fields is associating polynomials to them. This technique was first used by Rédei, Jamison, Lovász, Schrijver and Bruen, then, followed by several people, became a standard method; nowadays, the contours of a growing theory can be seen already. The polynomials we use should reflect the combinatorial p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1981
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-112-3-205-214