The space complexity of the unique decipherability problem

DOI10.1016/0020-0190(86)90121-3MaRDI QIDQ1087017zbMATH OpenOpenAlexFDO

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

Cites work

• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A note on uniquely decipherable codes (Corresp.)
• Tests for unique decipherability

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087017)