Source Coding Using Families of Universal Hash Functions
From MaRDI portal
Publication:3549007
DOI10.1109/TIT.2007.903113zbMATH Open1325.94081OpenAlexW2158671532MaRDI QIDQ3549007FDOQ3549007
Authors: Hiroki Koga
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2007.903113
Recommendations
- On a family of universal hash functions
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
- Hash Property and Fixed-Rate Universal Coding Theorems
- Universal hashing and geometric codes
- Strongly universal hashing and identification codes via channels
- Universal hash-function families: from hashing to authentication
- scientific article; zbMATH DE number 1088255
- scientific article; zbMATH DE number 1024067
- scientific article; zbMATH DE number 4132087
- scientific article; zbMATH DE number 1874366
Cited In (5)
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
- Title not available (Why is that?)
- Linear codes for sources and source networks: Error exponents, universal coding
- Recursive constructions of secure codes and hash families using difference function families.
- Strongly universal hashing and identification codes via channels
This page was built for publication: Source Coding Using Families of Universal Hash Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549007)