Abstract
In this paper we study permutations of finite fields F q that decompose as products of cycles of the same length, and are obtained using monomials \(x^i \in F_q[x]\). We give the necessary and sufficient conditions on the exponent i to obtain such permutations. We also present formulas for counting the number of this type of permutations. An application to the construction of encoders for turbo codes is also discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahmad, S.: Cycle structure of automorphisms of finite cyclic groups. J. Comb. Thy. 6, 370–374 (1969)
Corrada-Bravo, C.J.: Sequence Designs for Applications in Ultra-wideband Systems and Turbo Codes, Ph.D. Thesis, Univesity of Southern California (August. 2002)
Corrada-Bravo, C.J., Rubio, I.: Deterministic Interleavers for Turbo Codes with Random-like Performance and Simple Implementation. In: Proceedings of the International Symposium on Turbo Codes, September 2003, pp. 555–558 (2003)
Lidl, R., Mullen, G.L.: Cycle Structure of Dickson Permutation Polynomials. Mathematical Journal of Okayama University 33, 1–11 (1991)
Rosen, K.: Elementary Number Theory and its Applications, 4th edn. Addison-Wesley, Reading (1999)
Rubio, I.: Cyclic Decomposition of Monomial Permutations, M.S. Thesis, University of Puerto Rico, Río Piedras (1988)
Takeshita, O., Costello, D.: New deterministic interleaver designs for turbo Codes. IEEE-IT 46, 1988–2006 (2000)
Vontobel, P.O.: On the Construction of Turbo Code Interleavers Based on Graphs with Large Girth. In: Proc. IEEE Intern. Conf. Communications, New York, NY, USA, April 28-May 2, vol. 3, pp. 1408–1412 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rubio, I.M., Corrada-Bravo, C.J. (2004). Cyclic Decomposition of Permutations of Finite Fields Obtained Using Monomials. In: Mullen, G.L., Poli, A., Stichtenoth, H. (eds) Finite Fields and Applications. Fq 2003. Lecture Notes in Computer Science, vol 2948. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24633-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-24633-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21324-6
Online ISBN: 978-3-540-24633-6
eBook Packages: Springer Book Archive