Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Multiset and set decipherable codes

From MaRDI portal
Publication:5948786
Jump to:navigation, search

DOI10.1016/S0898-1221(01)00096-7zbMath0989.94034OpenAlexW2073488629MaRDI QIDQ5948786

No author found.

Publication date: 12 November 2001

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(01)00096-7


zbMATH Keywords

domino graphsmultiset decipherabilityprefix codesset decipherabilitysuffix codesunique decipherable codes


Mathematics Subject Classification ID

Paths and cycles (05C38) Decoding (94B35) Prefix, length-variable, comma-free codes (94A45)


Related Items (4)

On fuzzy multiset automata ⋮ Factorization in Formal Languages ⋮ Fuzzy multiset finite automata and their languages ⋮ Unique decipherability in formal languages




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Decipherability of codes
  • Note on decipherability of three-word codes
  • On multiset decipherable codes (Corresp.)
  • A note on multiset decipherable codes
  • On unique, multiset, and set decipherability of three-word codes
  • Deciding multiset decipherability




This page was built for publication: Multiset and set decipherable codes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5948786&oldid=12114910"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki