有村 光晴

A Class of Data Compression Where the Codeword is a Computer Program Generating the Data

Proc. 2022 International Symposium on Information Theory and its Applications (ISITA2022) 266-270 2022年10月17日  査読有り筆頭著者

A variable-to-fixed length lossless source code attaining better performance than tunstall code in several criterions

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E101A(1) 249-258 2018年1月1日  査読有り筆頭著者

Average Coding Rate of a Multi-Shot Tunstall Code with an Arbitrary Parsing Tree Sequence

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E99A(12) 2281-2285 2016年12月  査読有り

Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E99A(12) 2130-2135 2016年12月  査読有り

A Two-Step Lniversal VV Code L sing an Asymptotically Sufficient Statistic Extracted from a VF Code

PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016) 6-10 2016年  査読有り

A Variable-to-Fixed Length Lossless Source Code Optimizing a Different Criterion of Average Coding Rate from Tunstall Code

PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016) 636-640 2016年  査読有り

A Grammar-Based Compression Using a Variation of Chomsky Normal Form of Context Free Grammar

PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016) 246-250 2016年  査読有り

Almost Sure Convergence Coding Theorems of One-Shot and Multi-Shot Tunstall Codes for Stationary Memoryless Sources

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E98A(12) 2393-2406 2015年12月  査読有り

Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet

2015 DATA COMPRESSION CONFERENCE (DCC) 452-452 2015年  査読有り

Evaluation of Maximum Redundancy of Data Compression via Substring Enumeration for k-th Order Markov Sources

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E97A(8) 1754-1760 2014年8月  査読有り

On the Coding Rate of a Multishot Tunstall Code for Stationary Memoryless Sources

2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA) 284-288 2014年  査読有り

A Characterization of Optimal FF Coding Rate Using a New Optimistically Optimal Code

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E96A(12) 2443-2446 2013年12月  査読有り

Relationships between the Classes of the Redundancy-Optimal and the Rate-Optimal FF Codes for a General Source

Proc. 8th Asian-European Workshop on Information Theory: Fundamental Concepts in Information Theory (AEW8) 4-8 2013年5月  

Redundancy-optimal FF codes for a general source and its relationships to the rate-optimal FF codes

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E96-A(12) 2332-2341 2013年  査読有り

On the Maximum Redundancy of CSE for IID Sources

2012 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2012) 489-492 2012年  査読有り

On Variable-to-Fixed Length Coding of A General Source with Infinite Alphabet

2012 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2012) 485-488 2012年  査読有り

An improvement in lossless data compression via substring enumeration

Proceedings - 2011 10th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2011 219-223 2011年  査読有り

Coding Theorems on the Worst-Case Redundancy of Fixed-Length Coding for a General Source

2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) 1327-1331 2011年  査読有り

On the Average Coding Rate of the Tunstall Code for Stationary and Memory less Sources

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E93A(11) 1904-1911 2010年11月  査読有り

The Minimum Achievable Redundancy Rate of Fixed-to-Fixed Length Source Codes for General Sources

Proc. 2010 International Symposium on Information Theory and its Applications (ISITA2010) 595-600 2010年10月  査読有り

On the Achievable Redundancy Rate of Fixed Length Source Code for General Sources

2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY 126-130 2010年  査読有り

Asymptotic redundancy of the MTF scheme for stationary ergodic sources

IEEE TRANSACTIONS ON INFORMATION THEORY 51(11) 3742-3752 2005年11月  査読有り

An extension of asymptotically sufficient statistic method for pointwise strong universality

2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2 505-509 2005年  査読有り

Asymptotically Sufficient Statistic Method for Evaluation of Pointwise Redundancy of FV Source Codes

Proc. 2004 International Symposium on Information Theory and its Applications (ISITA2004) 769-774 2004年10月  査読有り

General conditions for existence of weakly universal FV source codes

2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS 110-110 2003年  査読有り

Redundancy of the MTF scheme for stationary ergodic sources

ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS 289-289 2002年  査読有り

Asymptotic optimality of the block sorting data compression algorithm

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E81A(10) 2117-2122 1998年10月  査読有り

Almost Sure Convergence Coding Theorem for Block Sorting Data Compression Algorithm

Proc. 1998 International Symposium on Information Theory and its Applications (ISITA98) 286-289 1998年10月  査読有り

A bitplane tree weighting method for lossless compression of gray scale images

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E80A(11) 2268-2271 1997年11月  査読有り

A Bitplane Tree Weighting Method for Gray Scale Images

Proc. 1996 International Symposium on Information Theory and its Applications (ISITA96) 1996年9月  査読有り