Abstract
Permutation polynomials in finite fields are introduced for the first time into the design of full frequency hop codes(FHCs). Various kinds of full FHCs with good auto- and cross-correlation functions are presented in this paper. For example, the second class of FHCs are the best full FHCs ever known.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Titlebaum,IEEE Trans. on AES,AES-17(1981)4, 490–493.
E. Titlebaum et al.,IEEE Trans. on AES,AES-17(1981)4, 494–499.
E. Titlebaum et al.,IEEE Trans. on AES,AES-27(1991)1, 18–29.
J. Bellegarda et al.,IEEE Trans. on AES,AES-24(1988)6, 726–742.
J. Bellegarda et al.,IEEE Trans. on AES,AES-27(1991)1, 167–172.
S. Maric et al.,IEEE Trans. on AES,AES-26(1990)6, 1035–1039.
S. Golomb et al.,Proc. IEEE,72(1984)9, 1143–1163.
D. Drumheller et al.,IEEE Trans. on AES,AES-27(1991)1, 2–10.
Yang Yixian,J. of Electronics,13(1991)4, 351–357, (in Chinese).
R. Mersereau et al.,IEEE Trans. on AES,AES-17(1981)4, 571–578.
R. Lidl et al., Finite Fields, Addison-Wesley Pub. Co., (1983).
Author information
Authors and Affiliations
Additional information
Supported by National Natural Sciences Foundation of China
About this article
Cite this article
Yixian, Y. A new method for designing full frequency hop codes. J. of Electron. (China) 10, 132–138 (1993). https://doi.org/10.1007/BF02684539
Issue Date:
DOI: https://doi.org/10.1007/BF02684539