IEICE Trans

Keyword : universal source coding

A Universal Two-Dimensional Source Coding by Means of Subblock Enumeration Takahiro OTA Hiroyoshi MORITA Akiko MANADA
Publication: Publication Date: 2019/02/01 Vol. E102-A No. 2 ; pp. 440-449 Type of Manuscript: PAPER Category: Information Theory Keyword: compression via substring enumeration, enumerative code, universal source coding, two-dimensional, general source,
	Summary \| Full Text:PDF(741.4KB)

A Compact Tree Representation of an Antidictionary Takahiro OTA Hiroyoshi MORITA
Publication: Publication Date: 2017/09/01 Vol. E100-A No. 9 ; pp. 1973-1984 Type of Manuscript: PAPER Category: Information Theory Keyword: antidictionary, universal source coding, two-pass, compression via substring enumeration, circular string, tree,
	Summary \| Full Text:PDF(420.6KB)

Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet Ken-ichi IWATA Mitsuharu ARIMURA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2016/12/01 Vol. E99-A No. 12 ; pp. 2130-2135 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Source Coding and Data Compression Keyword: lossless data compression, universal source coding, data compression via substring enumeration, k-th order Markov sources, maximum redundancy,
	Summary \| Full Text:PDF(350.8KB)

Evaluation of the Bayes Code from Viewpoints of the Distribution of Its Codeword Lengths Shota SAITO Nozomi MIYA Toshiyasu MATSUSHIMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2015/12/01 Vol. E98-A No. 12 ; pp. 2407-2414 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Source Coding Keyword: asymptotic normality, Bayes code, law of the iterated logarithm, overflow probability, universal source coding,
	Summary \| Full Text:PDF(512.3KB)

Evaluation of Maximum Redundancy of Data Compression via Substring Enumeration for k-th Order Markov Sources Ken-ichi IWATA Mitsuharu ARIMURA Yuki SHIMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2014/08/01 Vol. E97-A No. 8 ; pp. 1754-1760 Type of Manuscript: PAPER Category: Information Theory Keyword: lossless data compression, universal source coding, data compression via substring enumeration, k-th order Markov sources, maximum redundancy,
	Summary \| Full Text:PDF(356.5KB)

Relationship among Complexities of Individual Sequences over Countable Alphabet Shigeaki KUZUOKA Tomohiko UYEMATSU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/07/01 Vol. E89-A No. 7 ; pp. 2047-2055 Type of Manuscript: PAPER Category: Information Theory Keyword: empirical entropy, individual sequence, Lempel-Ziv algorithm, universal source coding,
	Summary \| Full Text:PDF(219.6KB)

Analysis of Zero-Redundancy Estimator with a Finite Window for Markovian Source Mohammad M. RASHID Tsutomu KAWABATA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2005/10/01 Vol. E88-A No. 10 ; pp. 2819-2825 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Information Theory Keyword: universal source coding, redundancy, zero-redundancy estimator, Markov source,
	Summary \| Full Text:PDF(202KB)

Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information Tomohiko UYEMATSU Shigeaki KUZUOKA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2003/10/01 Vol. E86-A No. 10 ; pp. 2615-2617 Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications) Category: Source Coding/Image Processing Keyword: conditional LZ complexity, conditional Ziv's inequality, universal source coding,
	Summary \| Full Text:PDF(134.3KB)

A Context Tree Weighting Algorithm with an Incremental Context Set Tsutomu KAWABATA Frans M. J. WILLEMS
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/10/25 Vol. E83-A No. 10 ; pp. 1898-1903 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Source Coding and Data Compression Keyword: universal source coding, data compression, context tree weighting, incremental context set, Lempel-Ziv parsing,
	Summary \| Full Text:PDF(350.6KB)