Skip to main content
Springer Nature Link
Log in

Domino Graphs and the Decipherability of Directed Figure Codes

  • Conference paper
Combinatorial Algorithms (IWOCA 2013)

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

Included in the following conference series:

  • 876 Accesses

Abstract

We consider several kinds of decipherability of directed figure codes, where directed figures are defined as labelled polyominoes with designated start and end points, equipped with catenation that may use a merging function for overlapping regions. This setting extends decipherability questions from words to 2D structures. In this paper we develop a (variant of) domino graph that will allow us to decide some of the decipherability kinds by searching the graph for specific paths. Thus the main result characterizes directed figure decipherability by graph properties.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  4. Kolarz, M., Moczurad, W.: Multiset, set and numerically decipherable codes over directed figures. In: Arumugam, S., Smyth, B. (eds.) IWOCA 2012. LNCS, vol. 7643, pp. 224–235. Springer, Heidelberg (2012)

    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

    Włodzimierz Moczurad

Authors
  1. Włodzimierz Moczurad
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. UFR des Sciences et Techniques, LITIS, Université de Rouen, 76821, EA 4180, Mont Saint Aignan Cedex, France

    Thierry Lecroq  & Laurent Mouchard  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moczurad, W. (2013). Domino Graphs and the Decipherability of Directed Figure Codes. In: Lecroq, T., Mouchard, L. (eds) Combinatorial Algorithms. IWOCA 2013. Lecture Notes in Computer Science, vol 8288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45278-9_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45278-9_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45277-2

  • Online ISBN: 978-3-642-45278-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics