Superposition of multiplicative multifractal traffic processes - Electronics Letters

  • S. Stankovid, Tilp
  • Published 2004

Abstract

Coding performance: We now present a comparison of the bit rate of our method with bit rates that could be obtained using a classical lossless compression algorithm. A k-subset of an n-set can be described using a memoryless channel model that outputs a word of length n using two symbols, say a 1 if the element of the corresponding rank is in the subset and… (More)

Topics

3 Figures and Tables

Cite this paper

@inproceedings{Stankovid2004SuperpositionOM, title={Superposition of multiplicative multifractal traffic processes - Electronics Letters}, author={S. Stankovid and Tilp}, year={2004} }