An algorithm for optimal prefix parsing of a noiseless and memoryless channel (Q5665110)

From MaRDI portal
Revision as of 04:23, 7 March 2024 by Import240305080351 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 3397434
Language Label Description Also known as
English
An algorithm for optimal prefix parsing of a noiseless and memoryless channel
scientific article; zbMATH DE number 3397434

    Statements

    An algorithm for optimal prefix parsing of a noiseless and memoryless channel (English)
    0 references
    0 references
    0 references
    0 references
    1973
    0 references

    Identifiers