Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes (Q5124437)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7253345
Language Label Description Also known as
default for all languages
No label defined
    English
    Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes
    scientific article; zbMATH DE number 7253345

      Statements

      Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes (English)
      0 references
      29 September 2020
      0 references

      Identifiers