|
|
All Technical Committee Conferences (Searched in: Recent 10 Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
WBS, IT, ISEC |
2021-03-05 15:25 |
Online |
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 (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 (Tokyo) |
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 (Chiba) |
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 (Osaka) |
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 (Tokyo) |
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 (Fukuoka) |
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 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|