default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMitsuharu Arimura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c13]Mitsuharu Arimura:
A Class of Data Compression Where The Codeword Is a Computer Program Generating The Data. ISITA 2022: 244-248
2010 – 2019
- 2018
- [j9]Mitsuharu Arimura:
A Variable-to-Fixed Length Lossless Source Code Attaining Better Performance than Tunstall Code in Several Criterions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(1): 249-258 (2018) - 2016
- [j8]Ken-ichi Iwata, Mitsuharu Arimura:
Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2130-2135 (2016) - [j7]Mitsuharu Arimura:
Average Coding Rate of a Multi-Shot Tunstall Code with an Arbitrary Parsing Tree Sequence. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2281-2285 (2016) - [c12]Mitsuharu Arimura, Hiroshi Nagaoka:
A two-step universal VV code using an asymptotically sufficient statistic extracted from a VF code. ISITA 2016: 6-10 - [c11]Mitsuharu Arimura:
A grammar-based compression using a variation of Chomsky normal form of context free grammar. ISITA 2016: 246-250 - [c10]Mitsuharu Arimura:
A variable-to-fixed length lossless source code optimizing a different criterion of average coding rate from Tunstall code. ISITA 2016: 636-640 - 2015
- [j6]Mitsuharu Arimura:
Almost Sure Convergence Coding Theorems of One-Shot and Multi-Shot Tunstall Codes for Stationary Memoryless Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(12): 2393-2406 (2015) - [c9]Ken-ichi Iwata, Mitsuharu Arimura:
Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet. DCC 2015: 452 - 2014
- [j5]Ken-ichi Iwata, Mitsuharu Arimura, Yuki Shima:
Evaluation of Maximum Redundancy of Data Compression via Substring Enumeration for k-th Order Markov Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(8): 1754-1760 (2014) - [c8]Mitsuharu Arimura:
On the coding rate of a multishot Tunstall code for stationary memoryless sources. ISITA 2014: 284-288 - 2013
- [j4]Mitsuharu Arimura, Hiroki Koga, Ken-ichi Iwata:
Redundancy-Optimal FF Codes for a General Source and Its Relationships to the Rate-Optimal FF Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(12): 2332-2342 (2013) - [j3]Mitsuharu Arimura, Hiroki Koga, Ken-ichi Iwata:
A Characterization of Optimal FF Coding Rate Using a New Optimistically Optimal Code. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(12): 2443-2446 (2013) - 2012
- [c7]Mitsuharu Arimura, Ken-ichi Iwata:
On variable-to-fixed length coding of a general source with infinite alphabet. ISITA 2012: 485-488 - [c6]Ken-ichi Iwata, Mitsuharu Arimura, Yuki Shima:
On the maximum redundancy of CSE for I.I.D. sources. ISITA 2012: 489-492 - 2011
- [c5]Ken-ichi Iwata, Mitsuharu Arimura, Yuki Shima:
An Improvement in Lossless Data Compression via Substring Enumeration. ACIS-ICIS 2011: 219-223 - [c4]Hiroki Koga, Mitsuharu Arimura, Ken-ichi Iwata:
Coding theorems on the worst-case redundancy of fixed-length coding for a general source. ISIT 2011: 1327-1331 - 2010
- [j2]Mitsuharu Arimura:
On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 1904-1911 (2010) - [c3]Mitsuharu Arimura, Ken-ichi Iwata:
On the achievable redundancy rate of fixed length source code for general sources. ISIT 2010: 126-130 - [c2]Mitsuharu Arimura, Ken-ichi Iwata:
The minimum achievable redundancy rate of fixed-to-fixed length source codes for general sources. ISITA 2010: 595-600
2000 – 2009
- 2005
- [j1]Mitsuharu Arimura, Hirosuke Yamamoto
:
Asymptotic redundancy of the MTF scheme for stationary ergodic sources. IEEE Trans. Inf. Theory 51(11): 3742-3752 (2005) - [c1]Mitsuharu Arimura, Hiroshi Nagaoka:
An extension of asymptotically sufficient statistic method for pointwise strong universality. ISIT 2005: 505-509
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
