Skip to main content
SpringerLink
Log in

Prefix partitioned gray codes for particular cross-bifix-free sets

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

A set of words with the property that no prefix of any word is the suffix of any other word is called cross-bifix-free set. We provide an efficient generating algorithm producing Gray codes for a remarkable family of cross-bifix-free sets.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Bajic, D.: On construction of cross-bifix-free kernel sets. 2nd MCM COST 2100, TD(07)237. Lisbon, Portugal (2007)

    Google Scholar 

  2. Bajic, D.: A simple suboptimal construction of cross-bifix-free codes. Crypt. Commun. 6(1), 27–37 (2014)

    Article  MATH  Google Scholar 

  3. Baril, J., Vajnovszki, V.: Gray code for derangements. Discret. Appl. Math. 140, 207–221 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Berstel, J., Perrin, D., Reutenauer, C.: Codes and automata (Encyclopedia of Mathematics and its Applications). Cambridge University Press (2009)

  5. Bilotta, S., Pergola, E., Pinzani, R.: A new approach to cross-bifix-free sets. IEEE Trans. Inf. Theory 58, 4058–4063 (2012)

    Article  MathSciNet  Google Scholar 

  6. Chee, Y.M., Kiah, H.M., Purkayastha, P., Wang, C.: Cross-bifix-free codes within a constant factor of optimality. IEEE Trans. Inf. Theory 59, 4668–4674 (2013)

    Article  MathSciNet  Google Scholar 

  7. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on strings. Cambridge University Press, Cambridge (2007)

    Book  MATH  Google Scholar 

  8. Er, M.C.: On generating the N-ary reflected Gray code. IEEE Trans. Comput. 33, 739–741 (1984)

    Article  MATH  Google Scholar 

  9. Gray, F.: Pulse code communication. U.S. Patent 2(632), 058 (1953)

    Google Scholar 

  10. Hamming, R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29, 147–160 (1950)

    Article  MathSciNet  Google Scholar 

  11. Joichi, J., White, D.E., Williamson, S.G.: Combinatorial gray codes. Siam J. Comput. 9, 130–141 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  12. Knuth, D.E.: The art of computer programming. Vol. 3, sorting and searching. Addison-Wesley, Reading, MA (1973)

    Google Scholar 

  13. Levesque, C.: On m-th order linear recurrences. Fibonacci Quart. 23, 290–293 (1985)

    MathSciNet  MATH  Google Scholar 

  14. de Lind van Wijngaarden, A.J., Willink, T.J.: Frame synchronization using distributed sequences. IEEE Trans. Commun. 48, 2127–2138 (2000)

    Article  Google Scholar 

  15. Ludman, J.E.: Gray code generation for MPSK signals. IEEE Trans. Commun. 29, 1519–1522 (1981)

    Article  Google Scholar 

  16. Johnson, S.M.: Generation of permutations by adjacent transpositions. Math. Comp. 17, 282–285 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  17. Nielsen, P.T.: A note on Bifix-free sequences. IEEE Trans. Inf. Theory 29, 704–706 (1973)

    Article  Google Scholar 

  18. Shork, M.: The r-generalized Fibonacci numbers and Polynomial coefficients. Int. J. Contemp. Math. Sci. 3, 1157–1163 (2008)

    MathSciNet  Google Scholar 

  19. Vajnovszki, V.: Gray visiting Motzkin. Acta Informatica 38, 793–811 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  20. Walsh, T.: Gray codes for involutions. J. Comb. Math. Comb. Comput. 36, 95–118 (2001)

    MATH  Google Scholar 

  21. Walsh, T.: Generating gray codes in O(1) worst-case time per word. Lect. Notes Comput. Sci 2731, 73–88 (2003)

    Article  Google Scholar 

  22. Williamson, S.G.: Combinatorics for computer science. Computer Science Press, Maryland (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Informatica “U. Dini”, Universitá degli Studi di Firenze, Viale G.B. Morgagni 65, 50134, Firenze, Italy

    Antonio Bernini, Stefano Bilotta & Renzo Pinzani

  2. LE2I, Université de Bourgogne, BP 47 870, 21078, Dijon Cedex, France

    Ahmad Sabri & Vincent Vajnovszki

Authors
  1. Antonio Bernini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefano Bilotta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Renzo Pinzani
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ahmad Sabri
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Vincent Vajnovszki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antonio Bernini.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bernini, A., Bilotta, S., Pinzani, R. et al. Prefix partitioned gray codes for particular cross-bifix-free sets. Cryptogr. Commun. 6, 359–369 (2014). https://doi.org/10.1007/s12095-014-0105-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-014-0105-6

Keywords

Mathematics Subjects Classification (2010)

Search

Navigation