An improved graph-entropy bound for perfect hashing
| dc.citation.spage | 314 | en_US |
| dc.contributor.author | Arıkan, Erdal | en_US |
| dc.coverage.spatial | Trondheim, Norway | en_US |
| dc.date.accessioned | 2016-02-08T12:01:24Z | |
| dc.date.available | 2016-02-08T12:01:24Z | |
| dc.date.issued | 1994-06-07 | en_US |
| dc.department | Department of Electrical and Electronics Engineering | en_US |
| dc.description | Date of Conference: 27 June-1 July 1994 | en_US |
| dc.description | Conference Name: International Symposium on Information Theory, IEEE 1994 | en_US |
| dc.description.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. | en_US |
| dc.description.provenance | Made available in DSpace on 2016-02-08T12:01:24Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1994 | en |
| dc.identifier.doi | 10.1109/ISIT.1994.394704 | en_US |
| dc.identifier.issn | 2157-8095 | en_US |
| dc.identifier.uri | http://hdl.handle.net/11693/27775 | |
| dc.language.iso | English | en_US |
| dc.publisher | IEEE | |
| dc.relation.isversionof | http://dx.doi.org/10.1109/ISIT.1994.394704 | en_US |
| dc.source.title | Proceedings of the International Symposium on Information Theory, IEEE 1994 | en_US |
| dc.subject | Upper bound | en_US |
| dc.subject | Information theory | en_US |
| dc.subject | Combinatorial mathematics | en_US |
| dc.subject | USA Councils | en_US |
| dc.title | An improved graph-entropy bound for perfect hashing | en_US |
| dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- An improved graph-entropy bound for perfect hashing.pdf
- Size:
- 64.46 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version