Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IT, EMM |
2024-05-30 15:35 |
Chiba |
Chiba University (Nishi-Chiba Campus) |
On the Complexity of Codewords on Fixed-to-Fixed Length Source Coding Mitsuharu Arimura, Mitsugu Iwamoto (UEC) |
(To be available after the conference date) [more] |
|
EA |
2023-05-25 14:25 |
Online |
Online |
Improved SPICE Modeling of Vacuum Tubes for Low Plate Voltage Mitsuharu Arimura (Shonan Inst. Tech.) EA2023-2 |
We have measured the characteristics of vacuum tubes for plate voltages as low as 20-30V and fitted to a mathematical mo... [more] |
EA2023-2 pp.9-14 |
RCC, ISEC, IT, WBS |
2023-03-14 14:15 |
Yamaguchi |
(Primary: On-site, Secondary: Online) |
Construction of Grammar-Based Codes Using the LZ78 Code and Its Variants Mitsuharu Arimura (Shonan Inst. Tech.) IT2022-103 ISEC2022-82 WBS2022-100 RCC2022-100 |
It is shown by Kieffer and Yang that Lempel-Ziv78 (LZ78) method can be implemented as a variation of grammar-based code.... [more] |
IT2022-103 ISEC2022-82 WBS2022-100 RCC2022-100 pp.224-229 |
EA, ASJ-H |
2022-08-04 16:30 |
Miyagi |
(Primary: On-site, Secondary: Online) |
SPICE Modeling of Vacuum Tubes for Low Plate Voltage
-- Comparison of Characteristics for Triode Connection of Pentodes and Triodes -- Mitsuharu Arimura (Shonan Inst. Tech.) EA2022-33 |
We measured the Ep-Ip characteristics of vacuum tubes and created SPICE models for low plate voltages (about 10V to 30V)... [more] |
EA2022-33 pp.26-31 |
IT |
2022-07-21 14:55 |
Okayama |
Okayama University of Science (Primary: On-site, Secondary: Online) |
A Data Compression Method Where The Codeword Is a Computer Program Generating The Data Mitsuharu Arimura (Shonan Inst. Tech.) IT2022-19 |
The Kolmogorov complexity of a string is defined as the shortest length of the program on a Turing machine used to repre... [more] |
IT2022-19 pp.18-23 |
MSS, CAS, SIP, VLD |
2019-07-31 09:10 |
Iwate |
Iwate Univ. |
Modeling of a Triode Vacuum Tube on Low Plate Voltage and Constructing an LTspice Model Mitsuharu Arimura (Shonan Inst. Tech.) CAS2019-11 VLD2019-17 SIP2019-27 MSS2019-11 |
The characteristic between the plate, grid voltage and plate current is measured at low plate voltage lower than 20V, fo... [more] |
CAS2019-11 VLD2019-17 SIP2019-27 MSS2019-11 pp.43-48 |
IT, ISEC, WBS |
2019-03-07 10:55 |
Tokyo |
University of Electro-Communications |
A Two-Step LZY Code by Excluding the Nodes Which Will Not be Used from the Candidate Set Mitsuharu Arimnura (Shonan Inst. Tech.) IT2018-92 ISEC2018-98 WBS2018-93 |
When blocks are parsed and encoded incrementally in the LZY code, which is a variation of the LZ78 code, the newly parse... [more] |
IT2018-92 ISEC2018-98 WBS2018-93 pp.103-108 |
IT, EMM |
2018-05-17 14:25 |
Tokyo |
Ookayama Campus, Tokyo Institute of Technology |
A Two-Step Source Code Using the Parsing Count of LZ78 Code as the First Step Mitsuharu Arimura (Shonan Inst. Tech.), Hiroshi Nagaoka (Univ. of Electro-Communications) IT2018-2 EMM2018-2 |
The redundancy of a two-step source code has been analyzed using the shape of the parsing tree of the Lempel-Ziv-Yokoo c... [more] |
IT2018-2 EMM2018-2 pp.7-12 |
WBS, IT, ISEC |
2018-03-08 10:15 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Evaluation of the Worst-Case Redundancy of Strongly Universal FV Source Codes Using the Source Approximation and the Asymptotically Sufficient Statistic Mitsuharu Arimura (Shonan Inst. Tech.), Hiroshi Nagaoka (Univ. of Electro-Comm.) IT2017-106 ISEC2017-94 WBS2017-87 |
The universality of some variations of two-step lossless source codes using asymptotically sufficient statistics were pr... [more] |
IT2017-106 ISEC2017-94 WBS2017-87 pp.19-24 |
IT, EMM |
2016-05-20 10:40 |
Hokkaido |
Otaru Economic Center |
A Grammar-Based Data Compression Algorithm Using Chomsky Normal Form of Context Free Grammar Mitsuharu Arimura (Shonan Inst. Tech.) IT2016-12 EMM2016-12 |
This paper proposes a new class of grammar-based lossless source code. For the simplicity, a Semi-Chomsky Normal Form (s... [more] |
IT2016-12 EMM2016-12 pp.69-74 |
IT, EMM |
2016-05-20 11:05 |
Hokkaido |
Otaru Economic Center |
Construction of A Two-Step Universal VV Code Using a Sufficient Statistic Extracted from a VF Code Mitsuharu Arimura (Shonan Inst. Tech.), Hiroshi Nagaoka (Univ. of Electro-Communications) IT2016-13 EMM2016-13 |
In this paper, some theorems which give relationships between a sufficient statistic and the universality of a VV source... [more] |
IT2016-13 EMM2016-13 pp.75-80 |
IT |
2015-07-13 11:15 |
Tokyo |
Tokyo Institute of Technology |
An Improvement on the Almost Sure Convergence Coding Theorems of One-shot and Multi-shot Tunstall Codes Mitsuharu Arimura (Shonan Inst. Tech.) IT2015-20 |
Almost sure convergence coding theorem have been proved for one-shot and multi-shot Tunstall codes. In the theorems, it ... [more] |
IT2015-20 pp.17-22 |
ISEC, IT, WBS |
2014-03-10 10:35 |
Aichi |
Nagoya Univ., Higashiyama Campus |
Maximum Redundancy of Lossless Data Compression via Substring Enumeration with a Finite Alphabet Ken-ichi Iwata (Univ. of Fukui), Mitsuharu Arimura (Shonan Inst. of Tech.) IT2013-55 ISEC2013-84 WBS2013-44 |
(To be available after the conference date) [more] |
IT2013-55 ISEC2013-84 WBS2013-44 pp.7-12 |
IT |
2013-05-24 15:10 |
Fukui |
Hotel Matuya Sensen at Awara-onsen, Fukui Pref. |
On the Existence Condition of a VF Code for an Infinite-Alphabet Source Mitsuharu Arimura (Shonan Inst. of Tech.), Ken-ichi Iwata (Fukui Univ.) IT2013-9 |
In this paper, the performance of a variable-to-fixed length code
(VF code) for a general source with countably infin... [more] |
IT2013-9 pp.41-46 |
IT, ISEC, WBS |
2013-03-07 13:40 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
Maximum Redundancy of Lossless Data Compression via Substring Enumeration for Markov Sources Ken-ichi Iwata (Univ. of Fukui), Mitsuharu Arimura (Shonan Inst. Tech.), Yuki Shima (Univ. of Fukui) IT2012-76 ISEC2012-94 WBS2012-62 |
Dub\'{e} and Beaudoin proposed a technique of lossless data compression called compression via substring enumeration (CS... [more] |
IT2012-76 ISEC2012-94 WBS2012-62 pp.95-100 |
IT |
2013-01-21 17:30 |
Tokyo |
Univ. of Electro-Communications |
On the FF Code with the Optimality on both the Redundancy and the Coding Rate Mitsuharu Arimura (Shonan Inst. Tech.), Hiroki Koga (Tsukuba Univ.), Ken-ichi Iwata (Fukui Univ.) IT2012-61 |
[more] |
IT2012-61 pp.71-76 |
IT |
2012-05-25 14:25 |
Fukuoka |
|
On the relationship between the redundancy and the coding rate of FF codes Mitsuharu Arimura (Shonan Inst. Tech.), Hiroki Koga (Tsukuba Univ.), Ken-ichi Iwata (Fukui Univ.) IT2012-2 |
Two kinds of optimality of the fixed-to-fixed length (FF) codes for a general source are studied. Han showed that the op... [more] |
IT2012-2 pp.7-12 |
IT |
2011-05-20 11:00 |
Osaka |
Osaka City University |
An Improvement of Lossless Data Compression via Substring Enumeration Yuki Shima, Ken-ichi Iwata (Univ. of Fukui), Mitsuharu Arimura (Shonan Inst. of Tech.) IT2011-1 |
(To be available after the conference date) [more] |
IT2011-1 pp.1-6 |
ISEC, IT, WBS |
2011-03-03 16:35 |
Osaka |
Osaka University |
The Width of Information-Spectrum and the Worst-Case Redundancy of Fixed-Length Coding Hiroki Koga (Univ. of Tsukuba), Mitsuharu Arimura (Shonan Inst. of Tech.), Ken-ichi Iwata (Univ. of Fukui) IT2010-83 ISEC2010-87 WBS2010-62 |
[more] |
IT2010-83 ISEC2010-87 WBS2010-62 pp.93-98 |
IT |
2010-07-22 16:00 |
Tokyo |
Kogakuin University |
The Minimum Achievable Redundancy Rate of Fixed-to-Fixed Length Lossless Source Codes for General Sources Mitsuharu Arimura (Shonan Inst. of Tech.), Ken-ichi Iwata (Univ. of Fukui) IT2010-21 |
This paper investigates the minimum achievable redundancy rate of fixed-to-fixed length lossless source codes (FF codes)... [more] |
IT2010-21 pp.57-62 |