On codes with a finite deciphering delay: Constructing uncompletable words
From MaRDI portal
Publication:5941067
DOI10.1016/S0304-3975(99)00160-7zbMath0974.68053OpenAlexW2040416787MaRDI QIDQ5941067
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00160-7
codecomplete subsetdeciphering delayprefix coderight uncompletable worduncompletable worduniform code
Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items
On the length of uncompletable words in unambiguous automata ⋮ Locally complete sets and finite decomposable codes
Cites Work
This page was built for publication: On codes with a finite deciphering delay: Constructing uncompletable words