Source Coding Using Families of Universal Hash Functions
スポンサーリンク
概要
- 論文の詳細を見る
This correspondence is concerned with new connections between source coding and two kinds of families of hash functions known as the families of universal hash functions and N-strongly universal hash functions, where N ges 2 is an integer. First, it is pointed out that such families contain classes of well-known source codes such as bin codes and linear codes. Next, performance of a source coding scheme using either of the two kinds of families is evaluated. An upper bound on the expectation of the decoding error probability is obtained for each family. The expectation of the decoding error probability is analyzed in detail for the cases of discrete memoryless sources and sources without the memoryless assumption under a certain class of decoders.
- IEEEの論文
IEEE | 論文
- Magnetic and Transport Properties of Nb/PdNi Bilayers
- Supersonic Ion Beam Driven by Permanent-Magnets-Induced Double Layer in an Expanding Plasma
- Surfactant Adsorption on Single-Crystal Silicon Surfaces in TMAH Solution: Orientation-Dependent Adsorption Detected by In Situ Infrared Spectroscopy
- Extended-range FMCW reflectometry using an optical loop with a frequency shifter
- Teachingless spray-painting of sculptured surface by an industrial robot