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

The space complexity of the unique decipherability problem

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

DOI10.1016/0020-0190(86)90121-3zbMath0609.68037OpenAlexW2041548975MaRDI QIDQ1087017

Wojciech Rytter

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90121-3



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)


Related Items (3)

The code problem for traces -- improving the boundaries ⋮ Decidability of code properties ⋮ Generalized factorizations of words and their algorithmic properties



Cites Work

  • Unnamed Item
  • Tests for unique decipherability
  • A note on uniquely decipherable codes (Corresp.)




This page was built for publication: The space complexity of the unique decipherability problem

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