Abstract
Quaternary constant-amplitude codes (codes over \({\mathbb Z}_4\)) of length \(2^m\) exist for every positive integer \(m\), and every codeword of such a code corresponds to a function from the binary \(m\)-tuples to \({\mathbb Z}_4\) having the bent property, called a generalized bent function. In this chapter, we extend previous constructions and propose a general approach which can lead to more generalized bent functions.
This research is supported by National Basic Research Program of China (Grant No. 2011CB302400).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Gathen, J.V.Z.: Tests for permutation polynomials. SIAM J. Comput. 20, 591–602 (1991)
Giesbrecht, M.: Factoring in skew-polynomial rings over finite fields. J. Symb. Comput. 26, 463–486 (1998)
Li, Y., Wang, M.: Permutation polynomials EA-equivalent to the inverse function over GF(\(2^n\)). Cryptogr. Commun. 3(3), 175–186 (2011)
Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1997)
McDonald, B.R.: Finite Rings with Identity. Marcel Dekker, New York (1974)
Paterson, K.G.: Generalized Reed-Muller codes and power control in OFDM modulation. IEEE Trans. Inf. Theory 46, 104–120 (2000)
Schmidt, K.U.: Quaternary constant-amplitude codes for multicode CDMA. IEEE Trans. Inf. Theory 55, 1824–1832 (2009)
Shparlinski, I.E.: A deterministic test for permutation polynomials. Comput. Complex. 2, 129–132 (1992)
Solé P., Tokareva N.: Connections between quaternary and binary bent functions. In: Cryptology ePrint Archives http://www.eprint.iacr.org/2009/544 (2009)
Wu, B., Liu, Z.: Linearized polynomials over finite fields revisited. Finite Fields Appl. 2, 79–100 (2013)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, X., Wu, B., Jin, Q., Liu, Z. (2014). Constructing Generalized Bent Functions from Trace Forms of Galois Rings. In: Feng, R., Lee, Ws., Sato, Y. (eds) Computer Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43799-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-662-43799-5_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43798-8
Online ISBN: 978-3-662-43799-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)