Skip to main content
SpringerLink
Log in

On Codeword Lengths Guaranteeing Synchronization

  • Conference paper
  • First Online:
Combinatorics on Words (WORDS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11682))

Included in the following conference series:

Abstract

Prefix codes such as Huffman codes are commonly used for loseless data compression. The class of synchronizing codes is often chosen to improve error resilience or to enable parallel decoding of data. Such codes have a special sequence whose occurrence realigns decoding process leading to recovery from errors in a data stream. In the present paper we identify a class of codes whose synchronizability depends only on the lengths of codewords. Namely, we show that every maximal finite prefix code with only two codeword lengths is synchronizing if and only if these lengths are coprime.

V. Gusev is supported by the Leverhulme Trust. E. Pribavkina was supported by Russian Ministry of Education and Science Project No. 1.3253.2017 and the Competitiveness Enhancement Program of Ural Federal University.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Araújo, J., Cameron, P.J., Steinberg, B.: Between primitive and 2-transitive: synchronization and its friends. EMS Surv. Math. Sci. 4(2), 101–184 (2017)

    Article  MathSciNet  Google Scholar 

  2. Berlinkov, M.V., Szykuła, M.: Algebraic synchronization criterion and computing reset words. Inf. Sci. 369, 718–730 (2016)

    Article  Google Scholar 

  3. Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press, New York (2009)

    Book  Google Scholar 

  4. Biskup, M.: Error resilience in compressed data - selected topics. Ph.D. thesis, University of Warsaw (2008)

    Google Scholar 

  5. Biskup, M.T., Plandowski, W.: Shortest synchronizing strings for Huffman codes. Theor. Comput. Sci. 410(38), 3925–3941 (2009)

    Article  MathSciNet  Google Scholar 

  6. Freiling, C.F., Jungreis, D.S., Theberge, F., Zeger, K.: Almost all complete binary prefix codes have a self-synchronizing string. IEEE Trans. Inf. Theory 49(9), 2219–2225 (2003)

    Article  MathSciNet  Google Scholar 

  7. Gerencsér, B., Gusev, V.V., Jungers, R.: Primitive sets of nonnegative matrices and synchronizing automata. SIAM J. Matrix Anal. Appl. 39(1), 83–98 (2018)

    Article  MathSciNet  Google Scholar 

  8. Gusev, V.V., Szykuła, M.: On the number of synchronizing colorings of digraphs. In: Drewes, F. (ed.) CIAA 2015. LNCS, vol. 9223, pp. 127–139. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-22360-5_11

    Chapter  MATH  Google Scholar 

  9. Gusev, V.V., Pribavkina, E.V.: On synchronizing colorings and the eigenvectors of digraphs. In: Faliszewski, P., Muscholl, A., Niedermeier, R. (eds.) Mathematical Foundations of Computer Science (MFCS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 58, pp. 48:1–48:14 (2016)

    Google Scholar 

  10. Gusev, V.V., Pribavkina, E.V., Szykuła, M.: Around the road coloring theorem. In: TUCS Proceedings of Russian Finnish Symposium on Discrete Mathematics, vol. 26, pp. 52–56 (2017)

    Google Scholar 

  11. Klein, S.T., Wiseman, Y.: Parallel Huffman decoding with applications to JPEG files. Comput. J. 46(5), 487–497 (2003)

    Article  Google Scholar 

  12. Perrin, D.: Codes conjugués. Inf. Control 20(3), 222–231 (1972)

    Article  Google Scholar 

  13. Perrin, D., Schützenberger, M.P.: Synchronizing prefix codes and automata and the road coloring problem. In: Symbolic dynamics and its applications, Contemporary Mathematics, vol. 135, pp. 295–318. American Mathematical Society (1992)

    Google Scholar 

  14. Pribavkina, E.V.: Slowly synchronizing automata with zero and noncomplete sets. Math. Notes 90(3), 411–417 (2011)

    Article  MathSciNet  Google Scholar 

  15. Ryzhikov, A., Szykuła, M.: Finding short synchronizing words for prefix codes. In: Potapov, I., Spirakis, P., Worrell, J. (eds.) Mathematical Foundations of Computer Science (MFCS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 117, pp. 21:1–21:14 (2018)

    Google Scholar 

  16. Salomaa, A.: Composition sequences for functions over a finite domain. Theor. Comput. Sci. 292(1), 263–281 (2003)

    Article  MathSciNet  Google Scholar 

  17. Sandberg, S.: Homing and synchronizing sequences. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 5–33. Springer, Heidelberg (2005). https://doi.org/10.1007/11498490_2

    Chapter  Google Scholar 

  18. Schützenberger, M.P.: On synchronizing prefix codes. Inf. Control 11(4), 396–401 (1967)

    Article  Google Scholar 

  19. Trahtman, A.N.: The road coloring problem. Israel J. Math. 172(1), 51–60 (2009)

    Article  MathSciNet  Google Scholar 

  20. Volkov, M.V.: Synchronizing automata and the Černý conjecture. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11–27. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-88282-4_4

    Chapter  Google Scholar 

  21. Weißenberger, A., Schmidt, B.: Massively parallel Huffman decoding on GPUs. In: International Conference on Parallel Processing (ICPP), pp. 27:1–27:10 (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Leverhulme Research Centre for Functional Materials Design, University of Liverpool, Liverpool, UK

    Vladimir V. Gusev

  2. Institute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russia

    Elena V. Pribavkina

Authors
  1. Vladimir V. Gusev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elena V. Pribavkina
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Elena V. Pribavkina .

Editor information

Editors and Affiliations

  1. Loughborough University, Loughborough, UK

    Robert Mercaş

  2. Loughborough University, Loughborough, UK

    Daniel Reidenbach

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gusev, V.V., Pribavkina, E.V. (2019). On Codeword Lengths Guaranteeing Synchronization. In: Mercaş, R., Reidenbach, D. (eds) Combinatorics on Words. WORDS 2019. Lecture Notes in Computer Science(), vol 11682. Springer, Cham. https://doi.org/10.1007/978-3-030-28796-2_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-28796-2_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-28795-5

  • Online ISBN: 978-3-030-28796-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation