Picture codes and deciphering delay
From MaRDI portal
Publication:515672
DOI10.1016/J.IC.2016.06.003zbMATH Open1368.68229OpenAlexW2431737286MaRDI QIDQ515672FDOQ515672
Authors: Marcella Anselmo, Dora Giammarresi, Maria Madonia 
Publication date: 16 March 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2016.06.003
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing and Combinatorics
- Multiset, Set and Numerically Decipherable Codes over Directed Figures
- Picture codes
- PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES
- Two dimensional prefix codes of pictures
- Title not available (Why is that?)
- Polyomino tilings, cellular automata and codicity
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet
- A characterization of recognizable picture languages by tilings by finite sets
- A codicity undecidable problem in the plane.
- Strong prefix codes of pictures
- Unambiguous recognizable two-dimensional languages
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Title not available (Why is that?)
- Picture codes with finite deciphering delay
- Error-correction, and finite-delay decodability
- Decidability of code properties
Cited In (7)
This page was built for publication: Picture codes and deciphering delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515672)
