Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Finite fields Algebra ). Showing records 1 – 30 of 23037 total matches.

[1] [2] [3] [4] [5] … [768]

Search Limiters

Last 2 Years | English Only

Degrees

Languages

Country

▼ Search Limiters


East Carolina University

1. Zhu, Yi. Random Walks on Finite Fields and Heisenberg Groups.

Degree: 2011, East Carolina University

 Let H be a finite group and [mu] a probability measure on H. This data determines an invariant random walk on H beginning from the… (more)

Subjects/Keywords: Finite fields (Algebra); Invariants

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhu, Y. (2011). Random Walks on Finite Fields and Heisenberg Groups. (Masters Thesis). East Carolina University. Retrieved from http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=14482

Chicago Manual of Style (16th Edition):

Zhu, Yi. “Random Walks on Finite Fields and Heisenberg Groups.” 2011. Masters Thesis, East Carolina University. Accessed September 19, 2020. http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=14482.

MLA Handbook (7th Edition):

Zhu, Yi. “Random Walks on Finite Fields and Heisenberg Groups.” 2011. Web. 19 Sep 2020.

Vancouver:

Zhu Y. Random Walks on Finite Fields and Heisenberg Groups. [Internet] [Masters thesis]. East Carolina University; 2011. [cited 2020 Sep 19]. Available from: http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=14482.

Council of Science Editors:

Zhu Y. Random Walks on Finite Fields and Heisenberg Groups. [Masters Thesis]. East Carolina University; 2011. Available from: http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=14482

2. NC DOCKS at East Carolina University; Zhu, Yi. Random Walks on Finite Fields and Heisenberg Groups.

Degree: 2011, NC Docks

 Let H be a finite group and [mu] a probability measure on H. This data determines an invariant random walk on H beginning from the… (more)

Subjects/Keywords: Finite fields (Algebra); Invariants

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

NC DOCKS at East Carolina University; Zhu, Y. (2011). Random Walks on Finite Fields and Heisenberg Groups. (Thesis). NC Docks. Retrieved from http://libres.uncg.edu/ir/ecu/f/0000-embargo-holder.txt

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

NC DOCKS at East Carolina University; Zhu, Yi. “Random Walks on Finite Fields and Heisenberg Groups.” 2011. Thesis, NC Docks. Accessed September 19, 2020. http://libres.uncg.edu/ir/ecu/f/0000-embargo-holder.txt.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

NC DOCKS at East Carolina University; Zhu, Yi. “Random Walks on Finite Fields and Heisenberg Groups.” 2011. Web. 19 Sep 2020.

Vancouver:

NC DOCKS at East Carolina University; Zhu Y. Random Walks on Finite Fields and Heisenberg Groups. [Internet] [Thesis]. NC Docks; 2011. [cited 2020 Sep 19]. Available from: http://libres.uncg.edu/ir/ecu/f/0000-embargo-holder.txt.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

NC DOCKS at East Carolina University; Zhu Y. Random Walks on Finite Fields and Heisenberg Groups. [Thesis]. NC Docks; 2011. Available from: http://libres.uncg.edu/ir/ecu/f/0000-embargo-holder.txt

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Oregon State University

3. Yanik, Tuğrul. New methods for finite field arithmetic.

Degree: PhD, Electrical and Computer Engineering, 2001, Oregon State University

 We describe novel methods for obtaining fast software implementations of the arithmetic operations in the finite field GF(p) and GF(p[superscript k]). In GF(p) we realize… (more)

Subjects/Keywords: Finite fields (Algebra)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yanik, T. (2001). New methods for finite field arithmetic. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/32447

Chicago Manual of Style (16th Edition):

Yanik, Tuğrul. “New methods for finite field arithmetic.” 2001. Doctoral Dissertation, Oregon State University. Accessed September 19, 2020. http://hdl.handle.net/1957/32447.

MLA Handbook (7th Edition):

Yanik, Tuğrul. “New methods for finite field arithmetic.” 2001. Web. 19 Sep 2020.

Vancouver:

Yanik T. New methods for finite field arithmetic. [Internet] [Doctoral dissertation]. Oregon State University; 2001. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/1957/32447.

Council of Science Editors:

Yanik T. New methods for finite field arithmetic. [Doctoral Dissertation]. Oregon State University; 2001. Available from: http://hdl.handle.net/1957/32447


University of Delaware

4. Castillo, Chris. A method for constructing groups of permutation polynomials and its application to projective geometry.

Degree: PhD, University of Delaware, Department of Mathematical Sciences, 2015, University of Delaware

 This dissertation presents original work on permutation polynomials over finite fields. From a consideration of the proof of Cayley's theorem, it is clear that any… (more)

Subjects/Keywords: Permutations.; Polynomials.; Finite fields (Algebra); Cayley algebras.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Castillo, C. (2015). A method for constructing groups of permutation polynomials and its application to projective geometry. (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/17430

Chicago Manual of Style (16th Edition):

Castillo, Chris. “A method for constructing groups of permutation polynomials and its application to projective geometry.” 2015. Doctoral Dissertation, University of Delaware. Accessed September 19, 2020. http://udspace.udel.edu/handle/19716/17430.

MLA Handbook (7th Edition):

Castillo, Chris. “A method for constructing groups of permutation polynomials and its application to projective geometry.” 2015. Web. 19 Sep 2020.

Vancouver:

Castillo C. A method for constructing groups of permutation polynomials and its application to projective geometry. [Internet] [Doctoral dissertation]. University of Delaware; 2015. [cited 2020 Sep 19]. Available from: http://udspace.udel.edu/handle/19716/17430.

Council of Science Editors:

Castillo C. A method for constructing groups of permutation polynomials and its application to projective geometry. [Doctoral Dissertation]. University of Delaware; 2015. Available from: http://udspace.udel.edu/handle/19716/17430

5. NC DOCKS at The University of North Carolina Wilmington; Psioda, Matthew. An examination of the structure of extension families of irreducible polynomials over finite fields.

Degree: 2009, NC Docks

 In this paper we examine the behavior of particular family of polynomial over a nite eld. The family studied is that obtained by composing an… (more)

Subjects/Keywords: Polynomials; Finite fields (Algebra)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

NC DOCKS at The University of North Carolina Wilmington; Psioda, M. (2009). An examination of the structure of extension families of irreducible polynomials over finite fields. (Thesis). NC Docks. Retrieved from http://libres.uncg.edu/ir/uncw/f/psiodam2006-1.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

NC DOCKS at The University of North Carolina Wilmington; Psioda, Matthew. “An examination of the structure of extension families of irreducible polynomials over finite fields.” 2009. Thesis, NC Docks. Accessed September 19, 2020. http://libres.uncg.edu/ir/uncw/f/psiodam2006-1.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

NC DOCKS at The University of North Carolina Wilmington; Psioda, Matthew. “An examination of the structure of extension families of irreducible polynomials over finite fields.” 2009. Web. 19 Sep 2020.

Vancouver:

NC DOCKS at The University of North Carolina Wilmington; Psioda M. An examination of the structure of extension families of irreducible polynomials over finite fields. [Internet] [Thesis]. NC Docks; 2009. [cited 2020 Sep 19]. Available from: http://libres.uncg.edu/ir/uncw/f/psiodam2006-1.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

NC DOCKS at The University of North Carolina Wilmington; Psioda M. An examination of the structure of extension families of irreducible polynomials over finite fields. [Thesis]. NC Docks; 2009. Available from: http://libres.uncg.edu/ir/uncw/f/psiodam2006-1.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Stellenbosch University

6. Djagba, Prudence. Contributions to the theory of Beidleman near-vector spaces.

Degree: PhD, Mathematical Sciences, 2019, Stellenbosch University

ENGLISH SUMMARY: (Please refer to the abstract on the full text for symbols that did not translate well into this abstract). The study of nearfields… (more)

Subjects/Keywords: Vector spaces; Nearfields; Beidleman, J. C.; Finite fields (Algebra); UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Djagba, P. (2019). Contributions to the theory of Beidleman near-vector spaces. (Doctoral Dissertation). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/107165

Chicago Manual of Style (16th Edition):

Djagba, Prudence. “Contributions to the theory of Beidleman near-vector spaces.” 2019. Doctoral Dissertation, Stellenbosch University. Accessed September 19, 2020. http://hdl.handle.net/10019.1/107165.

MLA Handbook (7th Edition):

Djagba, Prudence. “Contributions to the theory of Beidleman near-vector spaces.” 2019. Web. 19 Sep 2020.

Vancouver:

Djagba P. Contributions to the theory of Beidleman near-vector spaces. [Internet] [Doctoral dissertation]. Stellenbosch University; 2019. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10019.1/107165.

Council of Science Editors:

Djagba P. Contributions to the theory of Beidleman near-vector spaces. [Doctoral Dissertation]. Stellenbosch University; 2019. Available from: http://hdl.handle.net/10019.1/107165


University of Delaware

7. Kodess, Aleksandr. Properties of some algebraically defined digraphs.

Degree: PhD, University of Delaware, Department of Mathematics, 2014, University of Delaware

This thesis is concerned with the study of a family of digraphs defined by systems of polynomial equations over finite fields. We explore the connectivity and diameter of some special classes of these digraphs, along with the structure of their isomorphism classes. Advisors/Committee Members: Lazebnik, Felix.

Subjects/Keywords: Directed graphs.; Polynomials.; Finite fields (Algebra); Isomorphisms (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kodess, A. (2014). Properties of some algebraically defined digraphs. (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/16756

Chicago Manual of Style (16th Edition):

Kodess, Aleksandr. “Properties of some algebraically defined digraphs.” 2014. Doctoral Dissertation, University of Delaware. Accessed September 19, 2020. http://udspace.udel.edu/handle/19716/16756.

MLA Handbook (7th Edition):

Kodess, Aleksandr. “Properties of some algebraically defined digraphs.” 2014. Web. 19 Sep 2020.

Vancouver:

Kodess A. Properties of some algebraically defined digraphs. [Internet] [Doctoral dissertation]. University of Delaware; 2014. [cited 2020 Sep 19]. Available from: http://udspace.udel.edu/handle/19716/16756.

Council of Science Editors:

Kodess A. Properties of some algebraically defined digraphs. [Doctoral Dissertation]. University of Delaware; 2014. Available from: http://udspace.udel.edu/handle/19716/16756


University of North Carolina – Wilmington

8. Psioda, Matthew. An examination of the structure of extension families of irreducible polynomials over finite fields.

Degree: 2009, University of North Carolina – Wilmington

 In this paper we examine the behavior of particular family of polynomial over a nite eld. The family studied is that obtained by composing an… (more)

Subjects/Keywords: Polynomials; Finite fields (Algebra)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Psioda, M. (2009). An examination of the structure of extension families of irreducible polynomials over finite fields. (Masters Thesis). University of North Carolina – Wilmington. Retrieved from http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=1641

Chicago Manual of Style (16th Edition):

Psioda, Matthew. “An examination of the structure of extension families of irreducible polynomials over finite fields.” 2009. Masters Thesis, University of North Carolina – Wilmington. Accessed September 19, 2020. http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=1641.

MLA Handbook (7th Edition):

Psioda, Matthew. “An examination of the structure of extension families of irreducible polynomials over finite fields.” 2009. Web. 19 Sep 2020.

Vancouver:

Psioda M. An examination of the structure of extension families of irreducible polynomials over finite fields. [Internet] [Masters thesis]. University of North Carolina – Wilmington; 2009. [cited 2020 Sep 19]. Available from: http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=1641.

Council of Science Editors:

Psioda M. An examination of the structure of extension families of irreducible polynomials over finite fields. [Masters Thesis]. University of North Carolina – Wilmington; 2009. Available from: http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=1641


Florida Atlantic University

9. Pace, Nicola. Coset intersection problem and application to 3-nets.

Degree: PhD, 2012, Florida Atlantic University

Summary: In a projective plane (PG(2, K) defined over an algebraically closed field K of characteristic p = 0, we give a complete classification of… (more)

Subjects/Keywords: Finite fields (Algebra); Mathematical physics; Field theory (Physics); Curves, Algebraic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pace, N. (2012). Coset intersection problem and application to 3-nets. (Doctoral Dissertation). Florida Atlantic University. Retrieved from http://purl.flvc.org/FAU/3355866

Chicago Manual of Style (16th Edition):

Pace, Nicola. “Coset intersection problem and application to 3-nets.” 2012. Doctoral Dissertation, Florida Atlantic University. Accessed September 19, 2020. http://purl.flvc.org/FAU/3355866.

MLA Handbook (7th Edition):

Pace, Nicola. “Coset intersection problem and application to 3-nets.” 2012. Web. 19 Sep 2020.

Vancouver:

Pace N. Coset intersection problem and application to 3-nets. [Internet] [Doctoral dissertation]. Florida Atlantic University; 2012. [cited 2020 Sep 19]. Available from: http://purl.flvc.org/FAU/3355866.

Council of Science Editors:

Pace N. Coset intersection problem and application to 3-nets. [Doctoral Dissertation]. Florida Atlantic University; 2012. Available from: http://purl.flvc.org/FAU/3355866


Hong Kong University of Science and Technology

10. Chan, Chin Hei MATH. On randomness properties of linear codes over finite fields.

Degree: 2019, Hong Kong University of Science and Technology

 In a series of papers, authors studied different kinds of randomness of linear codes over finite fields. One is the randomness in terms of weight… (more)

Subjects/Keywords: Random variables ; Differential equations, Linear ; Stochastic processes ; Finite fields (Algebra) ; Probabilities

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chan, C. H. M. (2019). On randomness properties of linear codes over finite fields. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-101568 ; https://doi.org/10.14711/thesis-991012752565103412 ; http://repository.ust.hk/ir/bitstream/1783.1-101568/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chan, Chin Hei MATH. “On randomness properties of linear codes over finite fields.” 2019. Thesis, Hong Kong University of Science and Technology. Accessed September 19, 2020. http://repository.ust.hk/ir/Record/1783.1-101568 ; https://doi.org/10.14711/thesis-991012752565103412 ; http://repository.ust.hk/ir/bitstream/1783.1-101568/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chan, Chin Hei MATH. “On randomness properties of linear codes over finite fields.” 2019. Web. 19 Sep 2020.

Vancouver:

Chan CHM. On randomness properties of linear codes over finite fields. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2019. [cited 2020 Sep 19]. Available from: http://repository.ust.hk/ir/Record/1783.1-101568 ; https://doi.org/10.14711/thesis-991012752565103412 ; http://repository.ust.hk/ir/bitstream/1783.1-101568/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chan CHM. On randomness properties of linear codes over finite fields. [Thesis]. Hong Kong University of Science and Technology; 2019. Available from: http://repository.ust.hk/ir/Record/1783.1-101568 ; https://doi.org/10.14711/thesis-991012752565103412 ; http://repository.ust.hk/ir/bitstream/1783.1-101568/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Arizona

11. GOMEZ-CALDERON, JAVIER. POLYNOMIALS WITH SMALL VALUE SET OVER FINITE FIELDS.

Degree: 1986, University of Arizona

 Let K(q) be the finite field with q elements and characteristic p. Let f(x) be a monic polynomial of degree d with coefficients in K(q).… (more)

Subjects/Keywords: Polynomials.; Finite fields (Algebra)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

GOMEZ-CALDERON, J. (1986). POLYNOMIALS WITH SMALL VALUE SET OVER FINITE FIELDS. (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/183933

Chicago Manual of Style (16th Edition):

GOMEZ-CALDERON, JAVIER. “POLYNOMIALS WITH SMALL VALUE SET OVER FINITE FIELDS. ” 1986. Doctoral Dissertation, University of Arizona. Accessed September 19, 2020. http://hdl.handle.net/10150/183933.

MLA Handbook (7th Edition):

GOMEZ-CALDERON, JAVIER. “POLYNOMIALS WITH SMALL VALUE SET OVER FINITE FIELDS. ” 1986. Web. 19 Sep 2020.

Vancouver:

GOMEZ-CALDERON J. POLYNOMIALS WITH SMALL VALUE SET OVER FINITE FIELDS. [Internet] [Doctoral dissertation]. University of Arizona; 1986. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10150/183933.

Council of Science Editors:

GOMEZ-CALDERON J. POLYNOMIALS WITH SMALL VALUE SET OVER FINITE FIELDS. [Doctoral Dissertation]. University of Arizona; 1986. Available from: http://hdl.handle.net/10150/183933


University of Arizona

12. Hunt, Bobby Ray, 1941-. THE ANALYSIS OF INTERCONNECTIONS OF SEQUENTIAL MACHINES BY POLYNOMIAL FUNCTION .

Degree: 1967, University of Arizona

Subjects/Keywords: System analysis.; Finite fields (Algebra)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hunt, Bobby Ray, 1. (1967). THE ANALYSIS OF INTERCONNECTIONS OF SEQUENTIAL MACHINES BY POLYNOMIAL FUNCTION . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/284921

Chicago Manual of Style (16th Edition):

Hunt, Bobby Ray, 1941-. “THE ANALYSIS OF INTERCONNECTIONS OF SEQUENTIAL MACHINES BY POLYNOMIAL FUNCTION .” 1967. Doctoral Dissertation, University of Arizona. Accessed September 19, 2020. http://hdl.handle.net/10150/284921.

MLA Handbook (7th Edition):

Hunt, Bobby Ray, 1941-. “THE ANALYSIS OF INTERCONNECTIONS OF SEQUENTIAL MACHINES BY POLYNOMIAL FUNCTION .” 1967. Web. 19 Sep 2020.

Vancouver:

Hunt, Bobby Ray 1. THE ANALYSIS OF INTERCONNECTIONS OF SEQUENTIAL MACHINES BY POLYNOMIAL FUNCTION . [Internet] [Doctoral dissertation]. University of Arizona; 1967. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10150/284921.

Council of Science Editors:

Hunt, Bobby Ray 1. THE ANALYSIS OF INTERCONNECTIONS OF SEQUENTIAL MACHINES BY POLYNOMIAL FUNCTION . [Doctoral Dissertation]. University of Arizona; 1967. Available from: http://hdl.handle.net/10150/284921

13. Hasan, Mohammed Anwarul. Efficient computations in Galois fields.

Degree: Department of Electrical and Computer Engineering, 2018, University of Victoria

 In this dissertation some algorithms and related hardware structures for computing division and multiplication over finite or Galois fields are presented. The structures are regular,… (more)

Subjects/Keywords: Finite fields (Algebra); Galois theory

fields is a branch of modern algebra. The origins of the subject can be traced back to the 17th… …finite prime fields. The general theory of finite fields began with the work of Carl Friedrich… …emergence of discrete mathematics as an im portant applied discipline, finite fields have also… …of finite fields and the theory of polynomials over finite fields have been applied to the… …finite fields, division and multiplication are widely CHAPTER 1. INTRODUCTION 3 used in… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hasan, M. A. (2018). Efficient computations in Galois fields. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9548

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hasan, Mohammed Anwarul. “Efficient computations in Galois fields.” 2018. Thesis, University of Victoria. Accessed September 19, 2020. https://dspace.library.uvic.ca//handle/1828/9548.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hasan, Mohammed Anwarul. “Efficient computations in Galois fields.” 2018. Web. 19 Sep 2020.

Vancouver:

Hasan MA. Efficient computations in Galois fields. [Internet] [Thesis]. University of Victoria; 2018. [cited 2020 Sep 19]. Available from: https://dspace.library.uvic.ca//handle/1828/9548.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hasan MA. Efficient computations in Galois fields. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9548

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of KwaZulu-Natal

14. Hsieh, Ai-Ni. Embedding theorems and finiteness properties for residuated structures and substructural logics.

Degree: PhD, Mathematics, 2008, University of KwaZulu-Natal

 Paper 1. This paper establishes several algebraic embedding theorems, each of which asserts that a certain kind of residuated structure can be embedded into a… (more)

Subjects/Keywords: Mathematics.; Embeddings (Mathematics); Finite fields (Algebra)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hsieh, A. (2008). Embedding theorems and finiteness properties for residuated structures and substructural logics. (Doctoral Dissertation). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/446

Chicago Manual of Style (16th Edition):

Hsieh, Ai-Ni. “Embedding theorems and finiteness properties for residuated structures and substructural logics.” 2008. Doctoral Dissertation, University of KwaZulu-Natal. Accessed September 19, 2020. http://hdl.handle.net/10413/446.

MLA Handbook (7th Edition):

Hsieh, Ai-Ni. “Embedding theorems and finiteness properties for residuated structures and substructural logics.” 2008. Web. 19 Sep 2020.

Vancouver:

Hsieh A. Embedding theorems and finiteness properties for residuated structures and substructural logics. [Internet] [Doctoral dissertation]. University of KwaZulu-Natal; 2008. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10413/446.

Council of Science Editors:

Hsieh A. Embedding theorems and finiteness properties for residuated structures and substructural logics. [Doctoral Dissertation]. University of KwaZulu-Natal; 2008. Available from: http://hdl.handle.net/10413/446


Florida Atlantic University

15. Amento, Brittanney Jaclyn. Quantum Circuits for Cryptanalysis.

Degree: 2016, Florida Atlantic University

Summary: Finite elds of the form F2m play an important role in coding theory and cryptography. We show that the choice of how to represent… (more)

Subjects/Keywords: Artificial intelligence; Computer networks; Cryptography; Data encryption (Computer science); Finite fields (Algebra); Quantum theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Amento, B. J. (2016). Quantum Circuits for Cryptanalysis. (Thesis). Florida Atlantic University. Retrieved from http://purl.flvc.org/fau/fd/FA00004662 ; (URL) http://purl.flvc.org/fau/fd/FA00004662

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Amento, Brittanney Jaclyn. “Quantum Circuits for Cryptanalysis.” 2016. Thesis, Florida Atlantic University. Accessed September 19, 2020. http://purl.flvc.org/fau/fd/FA00004662 ; (URL) http://purl.flvc.org/fau/fd/FA00004662.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Amento, Brittanney Jaclyn. “Quantum Circuits for Cryptanalysis.” 2016. Web. 19 Sep 2020.

Vancouver:

Amento BJ. Quantum Circuits for Cryptanalysis. [Internet] [Thesis]. Florida Atlantic University; 2016. [cited 2020 Sep 19]. Available from: http://purl.flvc.org/fau/fd/FA00004662 ; (URL) http://purl.flvc.org/fau/fd/FA00004662.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Amento BJ. Quantum Circuits for Cryptanalysis. [Thesis]. Florida Atlantic University; 2016. Available from: http://purl.flvc.org/fau/fd/FA00004662 ; (URL) http://purl.flvc.org/fau/fd/FA00004662

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


East Carolina University

16. Zhu, Yi. Random Walks on Finite Fields and Heisenberg Groups.

Degree: MA, Mathematics, 2011, East Carolina University

 Let H be a finite group and [mu] a probability measure on H. This data determines an invariant random walk on H beginning from the… (more)

Subjects/Keywords: Mathematics; Gelfand pairs; Heisenberg group; Random walks (Mathematics); Spherical functions; Finite fields (Algebra); Invariants

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhu, Y. (2011). Random Walks on Finite Fields and Heisenberg Groups. (Masters Thesis). East Carolina University. Retrieved from http://hdl.handle.net/10342/3603

Chicago Manual of Style (16th Edition):

Zhu, Yi. “Random Walks on Finite Fields and Heisenberg Groups.” 2011. Masters Thesis, East Carolina University. Accessed September 19, 2020. http://hdl.handle.net/10342/3603.

MLA Handbook (7th Edition):

Zhu, Yi. “Random Walks on Finite Fields and Heisenberg Groups.” 2011. Web. 19 Sep 2020.

Vancouver:

Zhu Y. Random Walks on Finite Fields and Heisenberg Groups. [Internet] [Masters thesis]. East Carolina University; 2011. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10342/3603.

Council of Science Editors:

Zhu Y. Random Walks on Finite Fields and Heisenberg Groups. [Masters Thesis]. East Carolina University; 2011. Available from: http://hdl.handle.net/10342/3603


University of Western Ontario

17. Costello, Colin S. A Generic Implementation of Fast Fourier Transforms for the BPAS Library.

Degree: 2020, University of Western Ontario

 In this thesis we seek to realize an efficient implementation of a generic parallel fast Fourier transform (FFT). The FFT will be used in support… (more)

Subjects/Keywords: Fast Fourier Transform; FFT over Finite Fields; DFT; Parallel Computing; Multi-core; Algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Costello, C. S. (2020). A Generic Implementation of Fast Fourier Transforms for the BPAS Library. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/7306

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Costello, Colin S. “A Generic Implementation of Fast Fourier Transforms for the BPAS Library.” 2020. Thesis, University of Western Ontario. Accessed September 19, 2020. https://ir.lib.uwo.ca/etd/7306.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Costello, Colin S. “A Generic Implementation of Fast Fourier Transforms for the BPAS Library.” 2020. Web. 19 Sep 2020.

Vancouver:

Costello CS. A Generic Implementation of Fast Fourier Transforms for the BPAS Library. [Internet] [Thesis]. University of Western Ontario; 2020. [cited 2020 Sep 19]. Available from: https://ir.lib.uwo.ca/etd/7306.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Costello CS. A Generic Implementation of Fast Fourier Transforms for the BPAS Library. [Thesis]. University of Western Ontario; 2020. Available from: https://ir.lib.uwo.ca/etd/7306

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

18. Caskey, Robert Alexander. Factorization of irreducible polynomials over a finite field.

Degree: 1975, NC Docks

In [6] the basic definitions and theorems of abstract algebra are defined and developed. The fundamental concepts of number theory can be found in [5]. The purpose of this thesis is to survey the development of the essential ideas in [2] from the material in [1] and [3].

Subjects/Keywords: Factors (Algebra); Polynomials; Finite fields (Algebra); Factorization (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Caskey, R. A. (1975). Factorization of irreducible polynomials over a finite field. (Thesis). NC Docks. Retrieved from http://libres.uncg.edu/ir/uncg/f/caskey_robert_1975.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Caskey, Robert Alexander. “Factorization of irreducible polynomials over a finite field.” 1975. Thesis, NC Docks. Accessed September 19, 2020. http://libres.uncg.edu/ir/uncg/f/caskey_robert_1975.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Caskey, Robert Alexander. “Factorization of irreducible polynomials over a finite field.” 1975. Web. 19 Sep 2020.

Vancouver:

Caskey RA. Factorization of irreducible polynomials over a finite field. [Internet] [Thesis]. NC Docks; 1975. [cited 2020 Sep 19]. Available from: http://libres.uncg.edu/ir/uncg/f/caskey_robert_1975.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Caskey RA. Factorization of irreducible polynomials over a finite field. [Thesis]. NC Docks; 1975. Available from: http://libres.uncg.edu/ir/uncg/f/caskey_robert_1975.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indian Institute of Science

19. Guha, Ashwin. An Algorithmic Characterization Of Polynomial Functions Over Zpn.

Degree: MSc Engg, Faculty of Engineering, 2014, Indian Institute of Science

 The problem of polynomial representability of functions is central to many branches of mathematics. If the underlying set is a finite field, every function can… (more)

Subjects/Keywords: Polynomial Functions; Polynomials Over Finite Fields; Polynomials Over Finite Rings; Polynomial Representability; Polynomial Functions - Algorithms; Polynomials; Functional Polynomial Equations; Zpn; Algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Guha, A. (2014). An Algorithmic Characterization Of Polynomial Functions Over Zpn. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2337

Chicago Manual of Style (16th Edition):

Guha, Ashwin. “An Algorithmic Characterization Of Polynomial Functions Over Zpn.” 2014. Masters Thesis, Indian Institute of Science. Accessed September 19, 2020. http://etd.iisc.ac.in/handle/2005/2337.

MLA Handbook (7th Edition):

Guha, Ashwin. “An Algorithmic Characterization Of Polynomial Functions Over Zpn.” 2014. Web. 19 Sep 2020.

Vancouver:

Guha A. An Algorithmic Characterization Of Polynomial Functions Over Zpn. [Internet] [Masters thesis]. Indian Institute of Science; 2014. [cited 2020 Sep 19]. Available from: http://etd.iisc.ac.in/handle/2005/2337.

Council of Science Editors:

Guha A. An Algorithmic Characterization Of Polynomial Functions Over Zpn. [Masters Thesis]. Indian Institute of Science; 2014. Available from: http://etd.iisc.ac.in/handle/2005/2337


Virginia Tech

20. Veliz-Cuba, Alan A. The Algebra of Systems Biology.

Degree: PhD, Mathematics, 2010, Virginia Tech

 In order to understand biochemical networks we need to know not only how their parts work but also how they interact with each other. The… (more)

Subjects/Keywords: Systems Biology; Finite Dynamical Systems; Reverse Engineering; Model Reduction; Finite Fields; Polynomial Algebra; Discrete Models; Mathematical Biology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Veliz-Cuba, A. A. (2010). The Algebra of Systems Biology. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/28240

Chicago Manual of Style (16th Edition):

Veliz-Cuba, Alan A. “The Algebra of Systems Biology.” 2010. Doctoral Dissertation, Virginia Tech. Accessed September 19, 2020. http://hdl.handle.net/10919/28240.

MLA Handbook (7th Edition):

Veliz-Cuba, Alan A. “The Algebra of Systems Biology.” 2010. Web. 19 Sep 2020.

Vancouver:

Veliz-Cuba AA. The Algebra of Systems Biology. [Internet] [Doctoral dissertation]. Virginia Tech; 2010. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10919/28240.

Council of Science Editors:

Veliz-Cuba AA. The Algebra of Systems Biology. [Doctoral Dissertation]. Virginia Tech; 2010. Available from: http://hdl.handle.net/10919/28240


Universidade Estadual de Campinas

21. Oliveira, Paulo Cesar Cavalcante de, 1974-. Sobre curvas maximais em superfícies cúbicas: On maximal curves in cubic surfaces.

Degree: 2016, Universidade Estadual de Campinas

 Abstract: The study of maximal curves was renewed after Goppa have shown their applications in Coding Theory. A well-known and studied maximal curve (in different… (more)

Subjects/Keywords: Curva maximal; Corpos finitos (Álgebra); Curvas em superfícies; Maximal curve; Finite fields (Algebra); Curves on surfaces

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Oliveira, Paulo Cesar Cavalcante de, 1. (2016). Sobre curvas maximais em superfícies cúbicas: On maximal curves in cubic surfaces. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/307069

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Oliveira, Paulo Cesar Cavalcante de, 1974-. “Sobre curvas maximais em superfícies cúbicas: On maximal curves in cubic surfaces.” 2016. Thesis, Universidade Estadual de Campinas. Accessed September 19, 2020. http://repositorio.unicamp.br/jspui/handle/REPOSIP/307069.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Oliveira, Paulo Cesar Cavalcante de, 1974-. “Sobre curvas maximais em superfícies cúbicas: On maximal curves in cubic surfaces.” 2016. Web. 19 Sep 2020.

Vancouver:

Oliveira, Paulo Cesar Cavalcante de 1. Sobre curvas maximais em superfícies cúbicas: On maximal curves in cubic surfaces. [Internet] [Thesis]. Universidade Estadual de Campinas; 2016. [cited 2020 Sep 19]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/307069.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oliveira, Paulo Cesar Cavalcante de 1. Sobre curvas maximais em superfícies cúbicas: On maximal curves in cubic surfaces. [Thesis]. Universidade Estadual de Campinas; 2016. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/307069

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

22. Adriano Gomes de Santana. Criptografia de curvas elípticas sobre extensões de corpos finitos.

Degree: 2013, Universidade Estadual de Londrina

An elliptic curve cryptosystem is based on the use of the encryption algorithm of public key of ElGamal on the group of points of the… (more)

Subjects/Keywords: Criptografia de chaves públicas; Elliptic curves; Public key cryptography; Finite fields (Algebra); Curvas elípticas; Corpos finitos (Álgebra)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Santana, A. G. d. (2013). Criptografia de curvas elípticas sobre extensões de corpos finitos. (Thesis). Universidade Estadual de Londrina. Retrieved from http://www.bibliotecadigital.uel.br/document/?code=vtls000182124

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Santana, Adriano Gomes de. “Criptografia de curvas elípticas sobre extensões de corpos finitos.” 2013. Thesis, Universidade Estadual de Londrina. Accessed September 19, 2020. http://www.bibliotecadigital.uel.br/document/?code=vtls000182124.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Santana, Adriano Gomes de. “Criptografia de curvas elípticas sobre extensões de corpos finitos.” 2013. Web. 19 Sep 2020.

Vancouver:

Santana AGd. Criptografia de curvas elípticas sobre extensões de corpos finitos. [Internet] [Thesis]. Universidade Estadual de Londrina; 2013. [cited 2020 Sep 19]. Available from: http://www.bibliotecadigital.uel.br/document/?code=vtls000182124.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Santana AGd. Criptografia de curvas elípticas sobre extensões de corpos finitos. [Thesis]. Universidade Estadual de Londrina; 2013. Available from: http://www.bibliotecadigital.uel.br/document/?code=vtls000182124

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Queensland University of Technology

23. Cazavan, Jilyana. Algorithms for finite field arithmetic and decoding of Reed-Solomon codes.

Degree: 1991, Queensland University of Technology

Subjects/Keywords: Algorithms; Finite fields (Algebra); Coding theory; thesis; masters

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Cazavan, J. (1991). Algorithms for finite field arithmetic and decoding of Reed-Solomon codes. (Thesis). Queensland University of Technology. Retrieved from http://eprints.qut.edu.au/35965/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Cazavan, Jilyana. “Algorithms for finite field arithmetic and decoding of Reed-Solomon codes.” 1991. Thesis, Queensland University of Technology. Accessed September 19, 2020. http://eprints.qut.edu.au/35965/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Cazavan, Jilyana. “Algorithms for finite field arithmetic and decoding of Reed-Solomon codes.” 1991. Web. 19 Sep 2020.

Vancouver:

Cazavan J. Algorithms for finite field arithmetic and decoding of Reed-Solomon codes. [Internet] [Thesis]. Queensland University of Technology; 1991. [cited 2020 Sep 19]. Available from: http://eprints.qut.edu.au/35965/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cazavan J. Algorithms for finite field arithmetic and decoding of Reed-Solomon codes. [Thesis]. Queensland University of Technology; 1991. Available from: http://eprints.qut.edu.au/35965/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Clemson University

24. Park, Jang-woo. Discrete Dynamics over Finite Fields.

Degree: PhD, Mathematics, 2009, Clemson University

 A dynamical system consists of a set V and a map f : V → V . The primary goal is to characterize points in… (more)

Subjects/Keywords: commutative algebra; discrete dynamics; finite fields; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Park, J. (2009). Discrete Dynamics over Finite Fields. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/422

Chicago Manual of Style (16th Edition):

Park, Jang-woo. “Discrete Dynamics over Finite Fields.” 2009. Doctoral Dissertation, Clemson University. Accessed September 19, 2020. https://tigerprints.clemson.edu/all_dissertations/422.

MLA Handbook (7th Edition):

Park, Jang-woo. “Discrete Dynamics over Finite Fields.” 2009. Web. 19 Sep 2020.

Vancouver:

Park J. Discrete Dynamics over Finite Fields. [Internet] [Doctoral dissertation]. Clemson University; 2009. [cited 2020 Sep 19]. Available from: https://tigerprints.clemson.edu/all_dissertations/422.

Council of Science Editors:

Park J. Discrete Dynamics over Finite Fields. [Doctoral Dissertation]. Clemson University; 2009. Available from: https://tigerprints.clemson.edu/all_dissertations/422


University of Oklahoma

25. Cook, John Paul. A Guided Reinvention of Ring, Integral Domain, and Field.

Degree: PhD, 2012, University of Oklahoma

 Abstract algebra enjoys a prestigious position in mathematics and the undergraduate mathematics curriculum. A typical abstract algebra course aims to provide students with a glimpse… (more)

Subjects/Keywords: Algebra, Abstract; Rings (Algebra); Algebraic fields

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Cook, J. P. (2012). A Guided Reinvention of Ring, Integral Domain, and Field. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/319010

Chicago Manual of Style (16th Edition):

Cook, John Paul. “A Guided Reinvention of Ring, Integral Domain, and Field.” 2012. Doctoral Dissertation, University of Oklahoma. Accessed September 19, 2020. http://hdl.handle.net/11244/319010.

MLA Handbook (7th Edition):

Cook, John Paul. “A Guided Reinvention of Ring, Integral Domain, and Field.” 2012. Web. 19 Sep 2020.

Vancouver:

Cook JP. A Guided Reinvention of Ring, Integral Domain, and Field. [Internet] [Doctoral dissertation]. University of Oklahoma; 2012. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/11244/319010.

Council of Science Editors:

Cook JP. A Guided Reinvention of Ring, Integral Domain, and Field. [Doctoral Dissertation]. University of Oklahoma; 2012. Available from: http://hdl.handle.net/11244/319010


Universidade Estadual de Campinas

26. Reis, Júlio César dos, 1979-. Graduações e identidades graduadas para álgebras de matrizes: Gradings and graded identities for matrix algebra.

Degree: 2012, Universidade Estadual de Campinas

 Abstract: In this PhD thesis we give bases of the graded polynomial identities of...Note: The complete abstract is available with the full electronic document Advisors/Committee… (more)

Subjects/Keywords: PI-álgebras; Identidade polinomial; Aneís graduados; Matrizes (Matemática); Corpos finitos (Álgebra); PI-algebras; Polynomial identity; Graded rings; Matrix algebra; Finite fields (Algebra)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Reis, Júlio César dos, 1. (2012). Graduações e identidades graduadas para álgebras de matrizes: Gradings and graded identities for matrix algebra. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/306363

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Reis, Júlio César dos, 1979-. “Graduações e identidades graduadas para álgebras de matrizes: Gradings and graded identities for matrix algebra.” 2012. Thesis, Universidade Estadual de Campinas. Accessed September 19, 2020. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306363.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Reis, Júlio César dos, 1979-. “Graduações e identidades graduadas para álgebras de matrizes: Gradings and graded identities for matrix algebra.” 2012. Web. 19 Sep 2020.

Vancouver:

Reis, Júlio César dos 1. Graduações e identidades graduadas para álgebras de matrizes: Gradings and graded identities for matrix algebra. [Internet] [Thesis]. Universidade Estadual de Campinas; 2012. [cited 2020 Sep 19]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/306363.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Reis, Júlio César dos 1. Graduações e identidades graduadas para álgebras de matrizes: Gradings and graded identities for matrix algebra. [Thesis]. Universidade Estadual de Campinas; 2012. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/306363

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Missouri – Columbia

27. Koh, Doowon, 1972-. Extension theorems in vector spaces over finite fields.

Degree: 2008, University of Missouri – Columbia

 We study the L[superscript p] - L[superscript r] boundedness of the extension operator associated with algebraic varieties such as nondegenerate quadratic surfaces, paraboloids, and cones… (more)

Subjects/Keywords: Fourier analysis; Vector spaces; Quadratic fields; Paraboloid; Finite fields (Algebra); Field extensions (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Koh, Doowon, 1. (2008). Extension theorems in vector spaces over finite fields. (Thesis). University of Missouri – Columbia. Retrieved from http://hdl.handle.net/10355/9097

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Koh, Doowon, 1972-. “Extension theorems in vector spaces over finite fields.” 2008. Thesis, University of Missouri – Columbia. Accessed September 19, 2020. http://hdl.handle.net/10355/9097.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Koh, Doowon, 1972-. “Extension theorems in vector spaces over finite fields.” 2008. Web. 19 Sep 2020.

Vancouver:

Koh, Doowon 1. Extension theorems in vector spaces over finite fields. [Internet] [Thesis]. University of Missouri – Columbia; 2008. [cited 2020 Sep 19]. Available from: http://hdl.handle.net/10355/9097.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Koh, Doowon 1. Extension theorems in vector spaces over finite fields. [Thesis]. University of Missouri – Columbia; 2008. Available from: http://hdl.handle.net/10355/9097

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

28. Baktir, Selcuk. Efficient Algorithms for Finite Fields, with Applications in Elliptic Curve Cryptography.

Degree: MS, 2003, Worcester Polytechnic Institute

 This thesis introduces a new tower field representation, optimal tower fields (OTFs), that facilitates efficient finite field operations. The recursive direct inversion method presented for… (more)

Subjects/Keywords: multiplication; OTF; optimal extension fields; finite fields; optimal tower fields; cryptography; OEF; inversion; finite field arithmetic; elliptic curve cryptography; Finite fields (Algebra); Curves; Elliptic; Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Baktir, S. (2003). Efficient Algorithms for Finite Fields, with Applications in Elliptic Curve Cryptography. (Thesis). Worcester Polytechnic Institute. Retrieved from etd-0501103-132249 ; https://digitalcommons.wpi.edu/etd-theses/613

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Baktir, Selcuk. “Efficient Algorithms for Finite Fields, with Applications in Elliptic Curve Cryptography.” 2003. Thesis, Worcester Polytechnic Institute. Accessed September 19, 2020. etd-0501103-132249 ; https://digitalcommons.wpi.edu/etd-theses/613.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Baktir, Selcuk. “Efficient Algorithms for Finite Fields, with Applications in Elliptic Curve Cryptography.” 2003. Web. 19 Sep 2020.

Vancouver:

Baktir S. Efficient Algorithms for Finite Fields, with Applications in Elliptic Curve Cryptography. [Internet] [Thesis]. Worcester Polytechnic Institute; 2003. [cited 2020 Sep 19]. Available from: etd-0501103-132249 ; https://digitalcommons.wpi.edu/etd-theses/613.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Baktir S. Efficient Algorithms for Finite Fields, with Applications in Elliptic Curve Cryptography. [Thesis]. Worcester Polytechnic Institute; 2003. Available from: etd-0501103-132249 ; https://digitalcommons.wpi.edu/etd-theses/613

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Texas State University – San Marcos

29. Rice, Joshua Andrew. Bounding the Index of a Normal Subgroup with a large class size.

Degree: MS, Mathematics, 2018, Texas State University – San Marcos

No abstract prepared. Advisors/Committee Members: Keller, Thomas M (advisor), Acosta, Maria T. (committee member), Shroff, Piyush (committee member).

Subjects/Keywords: Group; Finite; Conjugacy; Class; Algebra; Index; Normal; Bound; Subgroup; Large; Size; Parameter; Character; Finite fields (Algebra); Group theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rice, J. A. (2018). Bounding the Index of a Normal Subgroup with a large class size. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/7452

Chicago Manual of Style (16th Edition):

Rice, Joshua Andrew. “Bounding the Index of a Normal Subgroup with a large class size.” 2018. Masters Thesis, Texas State University – San Marcos. Accessed September 19, 2020. https://digital.library.txstate.edu/handle/10877/7452.

MLA Handbook (7th Edition):

Rice, Joshua Andrew. “Bounding the Index of a Normal Subgroup with a large class size.” 2018. Web. 19 Sep 2020.

Vancouver:

Rice JA. Bounding the Index of a Normal Subgroup with a large class size. [Internet] [Masters thesis]. Texas State University – San Marcos; 2018. [cited 2020 Sep 19]. Available from: https://digital.library.txstate.edu/handle/10877/7452.

Council of Science Editors:

Rice JA. Bounding the Index of a Normal Subgroup with a large class size. [Masters Thesis]. Texas State University – San Marcos; 2018. Available from: https://digital.library.txstate.edu/handle/10877/7452


University of New South Wales

30. Jogia, Danesh Michael. Algebraic aspects of integrability and reversibility in maps.

Degree: Mathematics & Statistics, 2008, University of New South Wales

 We study the cause of the signature over finite fields of integrability in two dimensional discrete dynamical systems by using theory from algebraic geometry. In… (more)

Subjects/Keywords: maps over finite fields; integrability; reversibility; algebraic dynamics; Geometry, Algebraic; Finite fields (Algebra); Maps

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jogia, D. M. (2008). Algebraic aspects of integrability and reversibility in maps. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/40947 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:2386/SOURCE2?view=true

Chicago Manual of Style (16th Edition):

Jogia, Danesh Michael. “Algebraic aspects of integrability and reversibility in maps.” 2008. Doctoral Dissertation, University of New South Wales. Accessed September 19, 2020. http://handle.unsw.edu.au/1959.4/40947 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:2386/SOURCE2?view=true.

MLA Handbook (7th Edition):

Jogia, Danesh Michael. “Algebraic aspects of integrability and reversibility in maps.” 2008. Web. 19 Sep 2020.

Vancouver:

Jogia DM. Algebraic aspects of integrability and reversibility in maps. [Internet] [Doctoral dissertation]. University of New South Wales; 2008. [cited 2020 Sep 19]. Available from: http://handle.unsw.edu.au/1959.4/40947 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:2386/SOURCE2?view=true.

Council of Science Editors:

Jogia DM. Algebraic aspects of integrability and reversibility in maps. [Doctoral Dissertation]. University of New South Wales; 2008. Available from: http://handle.unsw.edu.au/1959.4/40947 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:2386/SOURCE2?view=true

[1] [2] [3] [4] [5] … [768]

.