Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
WBS, IT, ISEC |
2021-03-05 15:25 |
Online |
Online |
[Invited Talk]
Lee Metric Error Correcting Codes on Two-Dimensional Lattices Hiroyoshi Morita (UEC) IT2020-153 ISEC2020-83 WBS2020-72 |
A decoding algorithm on correcting double Lee errors on the two dimensional hexagonal lattice is presented. This algori... [more] |
IT2020-153 ISEC2020-83 WBS2020-72 pp.251-256 |
ISEC, IT, WBS |
2020-03-11 11:20 |
Hyogo |
University of Hyogo (Cancelled but technical report was issued) |
On the Existence of Bonds for Constrained Systems Akiko Manada (SIT), Takahiro Ota (NPIT), Hiroyoshi Morita (UEC) IT2019-119 ISEC2019-115 WBS2019-68 |
A constrained system is a set of words satisfying some constraints on the appearance of subwords, and the study on syste... [more] |
IT2019-119 ISEC2019-115 WBS2019-68 pp.195-199 |
WBS, IT, ISEC |
2018-03-09 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 Electro-Communications) IT2017-132 ISEC2017-120 WBS2017-113 |
(To be available after the conference date) [more] |
IT2017-132 ISEC2017-120 WBS2017-113 pp.173-177 |
IT |
2017-07-14 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) IT2017-34 |
Compression by substring enumeration (CSE) is a lossless universal coding algorithm.Experimental results show that the c... [more] |
IT2017-34 pp.103-108 |
RCS, IT, SIP |
2016-01-19 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) IT2015-79 SIP2015-93 RCS2015-311 |
The Low-Density Parity-Check(LDPC) codes exhibit good performance by the Belief Propagation (BP) decoding. The Group Shu... [more] |
IT2015-79 SIP2015-93 RCS2015-311 pp.173-177 |
IT |
2015-07-13 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) IT2015-18 |
In this paper, we evaluate error-correcting performance of some Irregular Repeat Accumulate (IRA)
codes, a class of Low... [more] |
IT2015-18 pp.7-12 |
ISEC, IT, WBS |
2015-03-02 15:10 |
Fukuoka |
The University of Kitakyushu |
A Study of Two-dimensional Antidictionary Coding Using Automata Takahiro Ota (NPIT), Hiroyoshi Morita (UEC) IT2014-78 ISEC2014-91 WBS2014-70 |
In one dimension, for an input string, an antidictionary is the set of all the minimal strings which do not appear in th... [more] |
IT2014-78 ISEC2014-91 WBS2014-70 pp.103-109 |
NLP |
2012-05-28 14:20 |
Akita |
Akita City Exchange Plaza |
Various Characters of Integer Logistic Map : Divergence, Convergence, and Periodicity Jiguo Dong (selic), Hiroyoshi Morita (uec) NLP2012-27 |
In this paper, we are concerred with the set of fractional numbers that do not have the initial-value sensitivity of th... [more] |
NLP2012-27 pp.11-16 |
MBE |
2012-01-27 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) MBE2011-82 |
An arrhythmia detection system using antidictionary coding has been proposed, and the system has the advantage of real-t... [more] |
MBE2011-82 pp.21-26 |
NLP |
2010-10-28 13:00 |
Osaka |
Osaka University Machikaneyama Hall |
Random Numbers Generation by Means of Integer Logistic Map and Mixing Operation Jiguo Dong, Hiroyoshi Morita (uec) NLP2010-84 |
In this work, we calculate a logistic map of arbitrary calculation accuracy(n bits) by integer operation, and, we propos... [more] |
NLP2010-84 pp.19-24 |
IN |
2010-10-15 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 Electro-Comm.) IN2010-72 |
In this paper we propose a new P2P routing system based on neighboring areas in Manhattan distance for location-related ... [more] |
IN2010-72 pp.39-44 |
IT |
2010-07-22 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 Electro-Comm.) IT2010-20 |
An antidictionary is in particular useful for data compression, and it consists of minimal forbidden words for a given s... [more] |
IT2010-20 pp.51-56 |
MBE |
2010-05-21 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) MBE2010-7 |
Antidictionary code is a lossless data compression algorithm, and efficient real-time electrocardiogram compression algo... [more] |
MBE2010-7 pp.35-40 |
IT, ISEC, WBS |
2010-03-04 09:50 |
Nagano |
Nagano-Engineering Campus, Shinshu University |
Evaluation of Mutual Anonymity in P2P Networks Chigusa Kawashima (Univ. of Electro-Comm.), Todorka Alexandrova (Tokyo Metro Univ.), I Gusti Bagus Baskara Nugraha, Hiroyoshi Morita (Univ. of Electro-Comm.) IT2009-74 ISEC2009-82 WBS2009-53 |
Anonymity is an important issue in nowadays networks. In this paper we propose mutually anonymous protocol for decentral... [more] |
IT2009-74 ISEC2009-82 WBS2009-53 pp.15-22 |
IT, ISEC, WBS |
2010-03-05 14:15 |
Nagano |
Nagano-Engineering Campus, Shinshu University |
Antidictionary Coding Scheme Based on Array Structures Keita Suzuki, Hirotada Fukae (Univ. of Electro-Comm.), Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (Univ. of Electro-Comm.) IT2009-124 ISEC2009-132 WBS2009-103 |
Given a string over a finite alphabet, a set of minimal forbidden words (MFW) that do not appear in the
string i... [more] |
IT2009-124 ISEC2009-132 WBS2009-103 pp.343-348 |
MBE |
2009-09-14 13:00 |
Niigata |
Niigata Univ. |
On the On-line ECG Lossless Data Compression Using Antidictionary for a Finite Alphabet Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (UEC) MBE2009-44 |
An antidictionary is particular useful for data compression, and on-line electrocardiogram (ECG) lossless compression al... [more] |
MBE2009-44 pp.35-40 |
IN |
2009-06-12 09:55 |
Fukui |
UNIVERSITY OF FUKUI |
Proposal of Distributed Managemant System for Location-related Information Kumiko Kobayashi (Japan Radio Co., Ltd), I Gusti Bagus Baskara Nugraha, Hiroyoshi Morita (Univ. of Electro-Comm.) IN2009-20 |
In this paper we propose a distributed location-related information system that collects and manages information gathere... [more] |
IN2009-20 pp.43-48 |
WBS, IT, ISEC |
2009-03-10 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 Electro-Commu.) IT2008-99 ISEC2008-157 WBS2008-112 |
An antidictionary is the set of all minimal strings, called Minimal Forbidden Words (MFWs), which never appear in an inp... [more] |
IT2008-99 ISEC2008-157 WBS2008-112 pp.363-370 |
IT |
2008-10-07 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. Electro-Commun.) IT2008-41 |
Arithmetic coding in the development of source coding brought a big change in how to build a probabilistic model for sou... [more] |
IT2008-41 pp.13-22 |
ISEC, IT, WBS |
2008-02-29 13:25 |
Tokyo |
|
Sliding Window Variation of Antidictionary Data Compression Takahiro Ota (PIT-nagano), Hiroyoshi Morita (UEC) IT2007-68 ISEC2007-165 WBS2007-99 |
An antidictionary is the set of all minimal strings that never appear in an input string, and efficient adaptive data co... [more] |
IT2007-68 ISEC2007-165 WBS2007-99 pp.127-132 |