Abstract
We prove nonexistence of almost p-ary perfect sequences of period n + 1, where n ∈ {50, 76, 94, 99, 100} and p is an odd prime dividing n − 1. This answers a question of Chee, Tan and Zhou.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beth, T., Jungnickel, D., Lenz, H.: Design Theory, 2nd edn. Cambridge University Press, New York (1999)
Chee, Y.M., Tan, Y., Zhou, Y.: Almost p-Ary Perfect Sequences. In: Carlet, C., Pott, A. (eds.) SETA 2010. LNCS, vol. 6338, pp. 399–415. Springer, Heidelberg (2010)
Jungnickel, D., Pott, A.: Perfect and almost perfect sequences. Discrete Applied Mathematics 95(1-3), 331–359 (1999)
Ma, S.L., Ng, W.S.: On nonexistence of perfect and nearly perfect sequences. Int. J. Inf. Coding Theory 1(1), 14–38 (2009)
Pott, A.: Finite Geometry and Character Theory. LNM, vol. 1601. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Özbudak, F., Yayla, O., Yıldırım, C.C. (2012). Nonexistence of Certain Almost p-ary Perfect Sequences. In: Helleseth, T., Jedwab, J. (eds) Sequences and Their Applications – SETA 2012. SETA 2012. Lecture Notes in Computer Science, vol 7280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30615-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-30615-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30614-3
Online ISBN: 978-3-642-30615-0
eBook Packages: Computer ScienceComputer Science (R0)