Joe Suzuki, Boris Ryabko  Home/Search
Context
Related
| math.sci.osakau.ac.jp/~su...isita00.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: math.sci.osakau.ac.jp/...papere (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the problem of coding combinatorial sources. By the combinatoral source, we simply mean a subset of the infinite sequences over the source alphabet. In general, source coding can be viewed as reducing the ratio of the cost of a channel seqeunce to that of its source sequence if suitable cost functions are given. The problem has been solved for the case of the costs being given by the lengths of source and channel sequences. In this paper, we solve the problem for the general case.... (Update)
Similar documents based on text: More All
0.2: The Simple Ideal Cipher System - Ryabko (2001) (Correct)
0.2: Performance of Data Compression in terms of Hausdorff Dimension - Hojo, Ryabko, SUZUKI (Correct)
0.2: It is not enough to assume stationary ergodic sources for.. - Hojo, Ryabko, Suzuki (1998) (Correct)
BibTeX entry: (Update)
@misc{ suzuki-coding,
author = "Joe Suzuki and Boris Ryabko",
title = "Coding Combinatorial Sources with Costs",
url = "citeseer.ist.psu.edu/suzuki00coding.html" }
Citations (may not include all citations):1447 A mathematical theory of communication (context) - Shannon - 1948
78 Ergodic theory and information (context) - Billingsley - 1965
66 Information Theory: Coding Theorems for Discrete Memoryless .. (context) - Csiszar, Korner - 1981
8 The fractional dimension of a set defined by decimal propert.. (context) - Eggleston - 1949
2 Combinatorial properties of Hausdorff dimension (context) - Staiger - 1989
1 Kluwer Academic Publishers (context) - Krichevsky, Compression - 1994
1 Noiseless coding of combinatorial sources, Haussdorff dimens.. (context) - Ryabko - 1986
1 Kolmogorov Complexity with Cost and the Randomness (context) - Kato - 1997
1 Three approaches to the definition of the 'amount of informa.. (context) - Kolmogorov - 1965
Documents on the same site (http://www.math.sci.osaka-u.ac.jp/~suzuki/paper-e.html): More
Fast Jacobian Group Arithmetic on C_ab Curves - Harasawa, Suzuki (Correct)
Realizing the Menezes-Okamoto-Vanstone (MOV) Reduction .. - Shikata, Zheng.. (2000) (Correct)
Performance of Data Compression in terms of Hausdorff Dimension - Hojo, Ryabko, SUZUKI (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC