Skip to main content
SpringerLink
Log in

Multiset, Set and Numerically Decipherable Codes over Directed Figures

  • Conference paper
Combinatorial Algorithms (IWOCA 2012)

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

Included in the following conference series:

Abstract

Codes with various kinds of decipherability, weaker than the usual unique decipherability, have been studied since multiset decipherability was introduced in mid-1980s. We consider decipherability of directed figure codes, where directed figures are defined as labelled polyominoes with designated start and end points, equipped with catenation operation that may use a merging function to resolve possible conflicts. This is one of possible extensions generalizing words and variable-length codes to planar structures.

Here, verification whether a given set is a code is no longer decidable in general. We study the decidability status of figure codes depending on catenation type (with or without a merging function), decipherability kind (unique, multiset, set or numeric) and code geometry (several classes determined by relative positions of start and end points of figures). We give decidability or undecidability proofs in all but two cases that remain open.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aigrain, P., Beauquier, D.: Polyomino tilings, cellular automata and codicity. Theoretical Computer Science 147(1-2), 165–180 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Beauquier, D., Nivat, M.: A codicity undecidable problem in the plane. Theoretical Computer Science 303(2-3), 417–430 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Blanchet-Sadri, F.: On unique, multiset, set decipherability of three-word codes. IEEE Transactions on Information Theory 47(5), 1745–1757 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Blanchet-Sadri, F., Morgan, C.: Multiset and set decipherable codes. Computers and Mathematics with Applications 41(10-11), 1257–1262 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Burderi, F., Restivo, A.: Coding partitions. Discrete Mathematics and Theoretical Computer Science 9(2), 227–240 (2007)

    MathSciNet  MATH  Google Scholar 

  6. Burderi, F., Restivo, A.: Varieties of codes and kraft inequality. Theory of Computing Systems 40(4), 507–520 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Costagliola, G., Ferrucci, F., Gravino, C.: Adding symbolic information to picture models: definitions and properties. Theoretical Computer Science 337, 51–104 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Giammarresi, D., Restivo, A.: Two-dimensional finite state recognizability. Fundamenta Informaticae 25(3), 399–422 (1996)

    MathSciNet  MATH  Google Scholar 

  9. Guzmán, F.: Decipherability of codes. Journal of Pure and Applied Algebra 141(1), 13–35 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Head, T., Weber, A.: The Finest Homophonic Partition and Related Code Concepts. In: Privara, I., Ružička, P., Rovan, B. (eds.) MFCS 1994. LNCS, vol. 841, pp. 618–628. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  11. Head, T., Weber, A.: Deciding multiset decipherability. IEEE Transactions on Information Theory 41(1), 291–297 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kolarz, M.: The code problem for directed figures. Theoretical Informatics and Applications RAIRO 44(4), 489–506 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kolarz, M.: Directed Figure Codes: Decidability Frontier. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 530–539. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. Kolarz, M., Moczurad, W.: Directed figure codes are decidable. Discrete Mathematics and Theoretical Computer Science 11(2), 1–14 (2009)

    MathSciNet  MATH  Google Scholar 

  15. Lempel, A.: On multiset decipherable codes. IEEE Transactions on Information Theory 32(5), 714–716 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  16. Mantaci, S., Restivo, A.: Codes and equations on trees. Theoretical Computer Science 255, 483–509 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  17. Moczurad, W.: Brick codes: families, properties, relations. International Journal of Computer Mathematics 74, 133–150 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  18. Moczurad, W.: Directed Figure Codes with Weak Equality. In: Fyfe, C., Tino, P., Charles, D., Garcia-Osorio, C., Yin, H. (eds.) IDEAL 2010. LNCS, vol. 6283, pp. 242–250. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  19. Restivo, A.: A note on multiset decipherable code. IEEE Transactions on Information Theory 35(3), 662–663 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  20. Salomaa, A., Salomaa, K., Yu, S.: Variants of codes and indecomposable languages. Information and Computation 207(11), 1340–1349 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Faculty of Mathematics and Computer Science, Jagiellonian University, Łojasiewicza 6, 30-348, Kraków, Poland

    Michał Kolarz & Włodzimierz Moczurad

Authors
  1. Michał Kolarz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Włodzimierz Moczurad
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Kalasalingam University, Anand Nagar, 626 126, Krishanakoil, Tamil Nadu, India

    S. Arumugam

  2. Algorithms Research Group, Department of Computing & Software, McMaster University, L8S 4K1, Hamilton, ON, Canada

    W. F. Smyth

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kolarz, M., Moczurad, W. (2012). Multiset, Set and Numerically Decipherable Codes over Directed Figures. In: Arumugam, S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2012. Lecture Notes in Computer Science, vol 7643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35926-2_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35926-2_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35925-5

  • Online ISBN: 978-3-642-35926-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation