Source coding using a class of universal hash functions

We consider a source coding scheme in which we use a mapping f /spl isin/ /spl Fscr/ as an encoder, where /spl Fscr/ is a class of universal hash functions. It is shown that, if /spl Fscr/ satisfies a certain condition, for any discrete source there exist an encoder using an f /spl isin/ /spl Fscr/ and a decoder such that the decoding error probability becomes negligible for sufficiently large blocklength. We also give the error exponent of the minimum-entropy decoder for i.i.d. sources that is not less than the error exponent of linear encoders.

[1]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[2]  Toby Berger,et al.  Review of Information Theory: Coding Theorems for Discrete Memoryless Systems (Csiszár, I., and Körner, J.; 1981) , 1984, IEEE Trans. Inf. Theory.

[3]  Imre Csiszár,et al.  Towards a general theory of source networks , 1980, IEEE Trans. Inf. Theory.

[4]  Jun Muramatsu,et al.  Source Coding Algorithms Using the Randomness of a Past Sequence , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[5]  Hiroki Koga,et al.  Information-Spectrum Methods in Information Theory , 2002 .

[6]  Hirosuke Yamamoto,et al.  Asymptotic properties on codeword lengths of an optimal FV code for general sources , 2005, IEEE Transactions on Information Theory.

[7]  Kaoru Kurosawa,et al.  Strongly universal hashing and identification codes via channels , 1999, IEEE Trans. Inf. Theory.

[8]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[9]  Thomas M. Cover,et al.  A Proof of the Data Compression Theorem of Slepian and Wolf for Ergodic Sources , 1971 .

[10]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[11]  Ueli Maurer,et al.  Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free , 2000, EUROCRYPT.

[12]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[13]  Hugo Krawczyk,et al.  LFSR-based Hashing and Authentication , 1994, CRYPTO.

[14]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[15]  T. J. Lynch,et al.  Sequence time coding for data compression , 1966 .

[16]  L. D. Davisson,et al.  Comments on "Sequence time coading for data compression" , 1966 .

[17]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[18]  Douglas R. Stinson,et al.  Universal hashing and authentication codes , 1991, Des. Codes Cryptogr..

[19]  Imre Csiszár.  Linear codes for sources and source networks: Error exponents, universal coding , 1982, IEEE Trans. Inf. Theory.

[20]  Ueli Maurer,et al.  Generalized privacy amplification , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.