Abstract
Ternary Barker sequences are sequences whose elements are in -1,0,1 for which every aperiodic offset autocorrelation has magnitude at most 1. Despite promising properties, they have received little attention from both the signals and mathematics communities. In this paper, we demonstrate the existence of ternary Barker sequences to answer a question of Millar. We enumerate ternary Barker sequences of length up to 44 and summarize some features of these sequences. Of primary interest is the density, or proportion of nonzero entries in a sequence. We also briefly examine the relation between density and merit factor.
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
Aigner, M.: Proofs from the book. Springer, Berlin (2010)
Balaji, N., Subba Rao, K., Srinivasa Rao, M.: FPGA implementation of ternary pulse compression sequences with superior merit factors. International Journal of Circuits, Systems and Signal Processing 3, 47–54 (2009)
Balaji, N., Subba Rao, K., Srinivasa Rao, M.: FPGA implementation of the ternary pulse compression sequences with good discrimination factor values. In: International Conference on Computer Engineering and Technology, vol. 2, pp. 353–357 (2009)
Barker, R.H.: Group synchronizing of binary digital systems. Communication Theory, 273–287 (1953)
Bose, R., Chowla, S.: Theorems in the additive theory of numbers. Commentarii Mathematici Helvetici 37, 141–147 (1962), doi:10.1007/BF02566968
Drakakis, K.: A review of the available construction methods for Golomb rulers. Advances in Mathematics of Communications 3, 235–250 (2009)
Golay, M.J.E.: The merit factor of long low autocorrelation binary sequences. IEEE Trans. Inform. Theory IT-28, 543–549 (1982)
Jedwab, J.: A Survey of the Merit Factor Problem for Binary Sequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 30–55. Springer, Heidelberg (2005)
Jedwab, J.: What can be used instead of a Barker sequence? Contemporary Mathematics 461, 153–178 (2008)
Jedwab, J., Katz, D., Schmidt, K.U.: Littlewood polynomials with small L4 norm (submitted)
Leung, K.H., Schmidt, B.: New restrictions on possible orders of circulant Hadamard matrices. In: Designs, Codes and Cryptography, pp. 1–9 (2011), doi:10.1007/s10623-011-9493-1
Millar, G.: Circulant weighing matrices. Master’s thesis (2009)
Moharir, P.S.: Signal design. International Journal of Electronics 41, 381–398 (1976)
Moharir, P.S.: Ternary Barker codes. Electronics Letters 10, 460–461 (1974)
Moharir, P.S., Verma, S.K., Venkata Rao, K.: Ternary pulse compression sequences. J. Inst. Electron. Telecomn. Engrs., 1–8 (1985)
Turyn, R.J.: Optimum codes study. Final report. Contract AF19(604)-5473. Sylvania Electronic Systems (1960)
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
Boothby, T. (2012). The Density of Ternary Barker 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_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-30615-0_29
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)