1 |
Studies on graph-based coding systemsSun, Jing 30 September 2004 (has links)
No description available.
|
2 |
Frobenius-Like Permutations and Their Cycle StructureVirani, Adil B 09 May 2015 (has links)
Polynomial functions over finite fields are a major tool in computer science and electrical engineering and have a long history. Some of its aspects, like interpolation and permutation polynomials are described in this thesis. A complete characterization of subfield compatible polynomials (f in E[x] such that f(K) is a subset of L, where K,L are subfields of E) was recently given by J. Hull. In his work, he introduced the Frobenius permutation which played an important role. In this thesis, we fully describe the cycle structure of the Frobenius permutation. We generalize it to a permutation called a monomial permutation and describe its cycle factorization. We also derive some important congruences from number theory as corollaries to our work.
|
3 |
有限体上的排列多項式之判斷準則的各種證明方法 / Various Proofs of PP's Criteria over Finite Fields解創智, Hsieh, Chuang-Chih Unknown Date (has links)
In this paper, we provide a complete survey of the important criteria for permutation polynomials over finite fields, including the classical Hermite-Dickson's Criterion and the recent Wan-Turnwald's Criterion. We review the various proofs of these criteria and give new proofs of them.
|
4 |
Polinômios de permutação sobre corpos finitosSilva, Ednailton Santos 13 September 2018 (has links)
Submitted by Geandra Rodrigues (geandrar@gmail.com) on 2018-10-30T13:59:20Z
No. of bitstreams: 1
ednailtonsantossilva.pdf: 606910 bytes, checksum: 393b9af5bb01a2b06e9ebb6ee0eee4cb (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2018-11-23T12:29:01Z (GMT) No. of bitstreams: 1
ednailtonsantossilva.pdf: 606910 bytes, checksum: 393b9af5bb01a2b06e9ebb6ee0eee4cb (MD5) / Made available in DSpace on 2018-11-23T12:29:01Z (GMT). No. of bitstreams: 1
ednailtonsantossilva.pdf: 606910 bytes, checksum: 393b9af5bb01a2b06e9ebb6ee0eee4cb (MD5)
Previous issue date: 2018-09-13 / O objetivo desse trabalho é apresentar algumas classes clássicas e outras mais recentes de polinômios de permutação sobre corpos finitos. A fim de atingir esse objetivo, apresentamos a construção e uma lista de propriedades de corpos finitos, bem como uma introdução à teoria dos polinômios sobre corpos finitos. / The main goal of this text is to present some known classes of permutation polynomials
over finite fields. With this goal, we begin by presenting the construction and some
properties of finite fields, as well as an introduction to the theory of polynomials over
finite fields.
|
Page generated in 0.1217 seconds