Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
ISEC, IT, WBS 
20200311 11:20 
Hyogo 
University of Hyogo 
On the Existence of Bonds for Constrained Systems Akiko Manada (SIT), Takahiro Ota (NPIT), Hiroyoshi Morita (UEC) IT2019119 ISEC2019115 WBS201968 
A constrained system is a set of words satisfying some constraints on the appearance of subwords, and the study on syste... [more] 
IT2019119 ISEC2019115 WBS201968 pp.195199 
WBS, IT, ISEC 
20180309 12:05 
Tokyo 
Katsusika Campas, Tokyo University of Science 
Consideration of error correction code suitable for WBAN Akihiro Yamada, Hiroyoshi Morita, Akiko Manada (The Univ. of ElectroCommunications) IT2017132 ISEC2017120 WBS2017113 
(To be available after the conference date) [more] 
IT2017132 ISEC2017120 WBS2017113 pp.173177 
IT 
20170714 14:45 
Chiba 
Chiba University 
Improved Lossless Data Compression via Substring Enumeration with a Finite Alphabet Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (UEC) IT201734 
Compression by substring enumeration (CSE) is a lossless universal coding algorithm.Experimental results show that the c... [more] 
IT201734 pp.103108 
RCS, IT, SIP 
20160119 10:10 
Osaka 
Kwansei Gakuin Univ. Osaka Umeda Campus 
Group Shuffled BP decoding based on Local Girth Kyohei Yoshida, Hiroyoshi Morita, Akiko Manada, Ryuichi Tatsukawa (UEC) IT201579 SIP201593 RCS2015311 
The LowDensity ParityCheck(LDPC) codes exhibit good performance by the Belief Propagation (BP) decoding. The Group Shu... [more] 
IT201579 SIP201593 RCS2015311 pp.173177 
IT 
20150713 10:25 
Tokyo 
Tokyo Institute of Technology 
Performance evaluation of Irregular Repeat Accumulate codes characterized by Tanner graphs with various degrees Ryuichi Tatsukawa, Akiko Manada, Hiroyoshi Morita (UEC) IT201518 
In this paper, we evaluate errorcorrecting performance of some Irregular Repeat Accumulate （IRA）
codes, a class of Low... [more] 
IT201518 pp.712 
ISEC, IT, WBS 
20150302 15:10 
Fukuoka 
The University of Kitakyushu 
A Study of Twodimensional Antidictionary Coding Using Automata Takahiro Ota (NPIT), Hiroyoshi Morita (UEC) IT201478 ISEC201491 WBS201470 
In one dimension, for an input string, an antidictionary is the set of all the minimal strings which do not appear in th... [more] 
IT201478 ISEC201491 WBS201470 pp.103109 
NLP 
20120528 14:20 
Akita 
Akita City Exchange Plaza 
Various Characters of Integer Logistic Map : Divergence, Convergence, and Periodicity Jiguo Dong (selic), Hiroyoshi Morita (uec) NLP201227 
In this paper, we are concerred with the set of fractional numbers that do not have the initialvalue sensitivity of th... [more] 
NLP201227 pp.1116 
MBE 
20120127 12:00 
Fukuoka 
Kyushu University 
On the Automatic Thresholding for Arrhythmia Detection Using Antidictionary Coding Takahiro Ota, Kiyokatsu Maruyama, Shinya Otagiri (NPIT), Hiroyoshi Morita (UEC) MBE201182 
An arrhythmia detection system using antidictionary coding has been proposed, and the system has the advantage of realt... [more] 
MBE201182 pp.2126 
NLP 
20101028 13:00 
Osaka 
Osaka University Machikaneyama Hall 
Random Numbers Generation by Means of Integer Logistic Map and Mixing Operation Jiguo Dong, Hiroyoshi Morita (uec) NLP201084 
In this work, we calculate a logistic map of arbitrary calculation accuracy(n bits) by integer operation, and, we propos... [more] 
NLP201084 pp.1924 
IN 
20101015 11:10 
Aichi 
Nagoya Institute of Technology 
Proposal of a P2P Routing Based on Neighboring Areas Kumiko Kobayashi (JRC), I Gusti Bagus Baskara Nugraha, Hiroyoshi Morita (Univ. of ElectroComm.) IN201072 
In this paper we propose a new P2P routing system based on neighboring areas in Manhattan distance for locationrelated ... [more] 
IN201072 pp.3944 
IT 
20100722 15:35 
Tokyo 
Kogakuin University 
An Almost Sure Convergence Proof of the Average Length of Minimal Forbidden Words on a Stationary Ergodic Source Takahiro Ota (NPIT), Hiroyoshi Morita (Univ. of ElectroComm.) IT201020 
An antidictionary is in particular useful for data compression, and it consists of minimal forbidden words for a given s... [more] 
IT201020 pp.5156 
MBE 
20100521 15:45 
Toyama 
Toyama Univ. 
On the Arrhythmia Detection Using Antidictionary Codes Takahiro Ota (NPIT), Keita Tomatsu (Yanagisawa Seiki), Jun Kimura (Koganei), Hiroyoshi Morita (UEC) MBE20107 
Antidictionary code is a lossless data compression algorithm, and efficient realtime electrocardiogram compression algo... [more] 
MBE20107 pp.3540 
IT, ISEC, WBS 
20100304 09:50 
Nagano 
NaganoEngineering Campus, Shinshu University 
Evaluation of Mutual Anonymity in P2P Networks Chigusa Kawashima (Univ. of ElectroComm.), Todorka Alexandrova (Tokyo Metro Univ.), I Gusti Bagus Baskara Nugraha, Hiroyoshi Morita (Univ. of ElectroComm.) IT200974 ISEC200982 WBS200953 
Anonymity is an important issue in nowadays networks. In this paper we propose mutually anonymous protocol for decentral... [more] 
IT200974 ISEC200982 WBS200953 pp.1522 
IT, ISEC, WBS 
20100305 14:15 
Nagano 
NaganoEngineering Campus, Shinshu University 
Antidictionary Coding Scheme Based on Array Structures Keita Suzuki, Hirotada Fukae (Univ. of ElectroComm.), Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (Univ. of ElectroComm.) IT2009124 ISEC2009132 WBS2009103 
Given a string over a ﬁnite alphabet, a set of minimal forbidden words (MFW) that do not appear in the
string i... [more] 
IT2009124 ISEC2009132 WBS2009103 pp.343348 
MBE 
20090914 13:00 
Niigata 
Niigata Univ. 
On the Online ECG Lossless Data Compression Using Antidictionary for a Finite Alphabet Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (UEC) MBE200944 
An antidictionary is particular useful for data compression, and online electrocardiogram (ECG) lossless compression al... [more] 
MBE200944 pp.3540 
IN 
20090612 09:55 
Fukui 
UNIVERSITY OF FUKUI 
Proposal of Distributed Managemant System for Locationrelated Information Kumiko Kobayashi (Japan Radio Co., Ltd), I Gusti Bagus Baskara Nugraha, Hiroyoshi Morita (Univ. of ElectroComm.) IN200920 
In this paper we propose a distributed locationrelated information system that collects and manages information gathere... [more] 
IN200920 pp.4348 
WBS, IT, ISEC 
20090310 10:15 
Hokkaido 
Hakodate Mirai Univ. 
Adaptive Antidictionary Data Compression Using a Set of Restricted Length of Minimal Forbidden Words Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (Univ. of ElectroCommu.) IT200899 ISEC2008157 WBS2008112 
An antidictionary is the set of all minimal strings, called Minimal Forbidden Words (MFWs), which never appear in an inp... [more] 
IT200899 ISEC2008157 WBS2008112 pp.363370 
IT 
20081007 15:50 
Tochigi 
Asaya Hotel(Kinugawa Onsen) 
[Invited Talk]
Practical Lossless Source Coding Which Achieves the Entropy Rate
 Focused on Recent Topics on Statistical Modeling for Arithmetic Codes  Hiroyoshi Morita (Univ. ElectroCommun.) IT200841 
Arithmetic coding in the development of source coding brought a big change in how to build a probabilistic model for sou... [more] 
IT200841 pp.1322 
ISEC, IT, WBS 
20080229 13:25 
Tokyo 

Sliding Window Variation of Antidictionary Data Compression Takahiro Ota (PITnagano), Hiroyoshi Morita (UEC) IT200768 ISEC2007165 WBS200799 
An antidictionary is the set of all minimal strings that never appear in an input string, and efficient adaptive data co... [more] 
IT200768 ISEC2007165 WBS200799 pp.127132 
CAS, NLP 
20071018 10:30 
Tokyo 
Musashi Institute of Technology 
Branch Prediction Based on Antidictionary Tree Mikihiko Nishiara (Shinshu Univ.), Hiroyoshi Morita (UEC), Takahiro Ota (PITNagano) CAS200738 NLP200766 
It is necessary to predict by high accuracy the results of the branch commands so as not to obstruct the speedup of mic... [more] 
CAS200738 NLP200766 pp.2124 