A Note on the Maximum Size of a Prefix Code
In the presented paper, we investigate the problem of finding the maximum possible cardinality of a dictionary of a prefix code for a string of a given length. Namely, we present a sharp proof of the cardinality of such a dictionary using results from the number theory. What is more, the presented f...
Main Authors: | Viliam Hromada, Otokar Grosek |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2022-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9950472/ |
Similar Items
-
A Cipher Based on Prefix Codes
by: Otokar Grošek, et al.
Published: (2021-09-01) -
Route Lookup Algorithms Using the Novel Idea of Coded Prefix Trees
by: Mohammad Behdadfar, et al.
Published: (2012-12-01) -
YIDDISH PREFIXED VERBS DESCRIBING THE ACHIEVEMENT OF A LONG-TERM ACTION OR PROCESS
by: O. V. Bader, et al.
Published: (2014-11-01) -
The Verbal Prefix do- in Russian and Ukrainian
by: David Schledewitz
Published: (2023-11-01) -
Verbs with Prefix po- in Russian Dialects of Amur Region
by: V. T. Sadchenko
Published: (2022-03-01)