• DocumentCode
    2619116
  • Title

    An improved graph-entropy bound for perfect hashing

  • Author

    Arikan, Erdal

  • Author_Institution
    Dept. of Electr. Eng., Bilkent Univ., Ankara, Turkey
  • fYear
    1994
  • fDate
    27 Jun-1 Jul 1994
  • Firstpage
    314
  • Abstract
    Gives an improved graph-entropy bound on the size of families of perfect hash functions. Examples are given illustrating that the new bound improves previous bounds in several instances
  • Keywords
    cryptography; entropy; file organisation; graph theory; sequences; family size; improved graph-entropy bound; perfect hashing; Combinatorial mathematics; Information theory; USA Councils; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
  • Conference_Location
    Trondheim
  • Print_ISBN
    0-7803-2015-8
  • Type

    conf

  • DOI
    10.1109/ISIT.1994.394704
  • Filename
    394704
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2619116