| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| IT | 2020-12-02 10:50 |
Online | Online | Enumeration and Coding of Binary AIFV-m Code Trees Genta Onishi, Kengo Hashimoto, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo)  IT2020-33 |
Using the one-to-one correspondence between binary AIFV codes and Schröder paths, Sumigawa and Yamamoto gave a method to... [more] | IT2020-33 pp.50-55 |
| IT | 2020-12-02 11:10 |
Online | Online | On the Optimality of the AIFV Code for Average Codeword Length Kengo Hashimoto, Ken-ichi Iwata (Univ. of Fukui) IT2020-34 |
McMillan's inequality proved that Huffman code attains an optimal average code length in a class of source codes that ... [more] |
IT2020-34 pp.56-61 |
| SAT, RCS (Joint) |
2020-08-20 09:00 |
Online | Online | Improvement of Frequency Utilization Efficiency by ACM for Beam Resource Control on High Throughput Satellite Communications System Mitsugu Ohkawa, Hiromitsu Wakana, Amane Miura (NICT) SAT2020-10 |
The resource control for frequency bandwidth and transmission power between beams is effective in Ka-band high capacity ... [more] | SAT2020-10 pp.1-6 |
| IT, EMM | 2020-05-29 09:30 |
Online | Online | A Study on the Achievable Region of Distributed Coding for Computing Three-Input Functions Naruki Joki, Shigeaki Kuzuoka (Wakayama Univ) IT2020-6 EMM2020-6 |
In this paper，a problem of distributed data compression for computing functions of outputs from correlated sources is st... [more] | IT2020-6 EMM2020-6 pp.31-36 |
| PN | 2020-04-24 15:05 |
Online | Online | [Invited Talk]
AIFV Code Construction Method and Optimization Method for Average Performance of Markov Chains with Finite States Ken-ichi Iwata, Ryusei Fujita (Univ. of Fukui), Hirosuke Yamamoto (Univ. of Tokyo) PN2020-3 |
We describe a construction method to design the optimal binary AIFV codes, which are defined by Yamamoto, Tsuchihashi, H... [more] | PN2020-3 pp.15-21 |
| RCS | 2019-10-25 16:05 |
Kanagawa | Yokosuka Research Park | [Encouragement Talk]
Nonlinear Feature Extraction by epsilon -Vanishing Polynomial Networks Learning and Underdetermined BSS Lu Wang, Tomoaki Ohtsuki (Keio Univ.) RCS2019-202 |
Similar to the deep architectures, a novel multi-layer architecture is used to extend the linear blind source separation... [more] | RCS2019-202 pp.133-138 |
| IT | 2019-09-06 11:10 |
Oita | Yufuin Kenshujo, Nippon Bunri University | A Study on Variable-to-Fixed Length Coding of General Sources Shigeaki Kuzuoka (Wakayama Univ.) IT2019-29 |
Variable-to-fixed length (VF) coding of General Sources is studied. In particular, the overflow probability, i.e., the ... [more] |
IT2019-29 pp.19-22 |
| EMM, IT | 2019-05-24 09:30 |
Hokkaido | Asahikawa International Conference Hall | A Consideration on Extended Ternary Memoryless Sources with a Simple Construction of Binary Compact Codes Nozomi Miya (Aoyama Gakuin Univ.), Takahiro Yoshida (Yokohama College of Commerce), Hajime Jinushi (Aoyama Gakuin Univ.) IT2019-7 EMM2019-7 |
The complexity of Huffman procedure grows with exponential order of $n$ for the $n$-th degree extended memoryless source... [more] | IT2019-7 EMM2019-7 pp.31-36 |
| IT, ISEC, WBS | 2019-03-07 09:30 |
Tokyo | University of Electro-Communications | Analysis of Zero-Redundancy Estimator with a Finite Window for Markovian Source
-- When the Statewise Alphabets are Unknown -- Yusuke Hashimoto, Tstutomu Kawabata (Univ. of Electro-Comm.) IT2018-89 ISEC2018-95 WBS2018-90 |
A Bayesian (Laplace or Krichevski-Trofimov) estimator for Markov source can be used to build a lossless source code. Ho... [more] |
IT2018-89 ISEC2018-95 WBS2018-90 pp.85-90 |
| 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 |
| CCS | 2018-11-23 13:00 |
Hyogo | Kobe Univ. | [Invited Talk]
Error-correction in neuro-inspired spike signaling Ferdinand Peper (NICT) CCS2018-42 |
Inspired by the spike-based signaling between neurons, we introduce impulse-based signaling for wireless communication, ... [more] | CCS2018-42 pp.51-56 |
| RCS, AP (Joint) |
2018-11-21 13:40 |
Okinawa | Okinawa Industry Support Center | [Tutorial Lecture]
From Turbo Equalization to Lossy Forwarding: Our Footprint Tadashi Matsumoto, Meng Cheng, Shen Qian (JAIST) RCS2018-202 |
A goal of this talk is to provide audience with the knowledge about the relationship between turbo equalization and the ... [more] | RCS2018-202 p.141 |
| IEE-CMN, EMM, LOIS, IE, ITE-ME [detail] | 2018-09-27 16:00 |
Oita | Beppu Int'l Convention Ctr. aka B-CON Plaza | Forward Error Correction of Linguistic Information (Digital Linguistics)
-- Dividing Errors by Author's Responsibility and Irresponsibility -- Kumon Tokumaru (Writer) LOIS2018-16 IE2018-36 EMM2018-55 |
DNA sequence inside nuclei of a fertilized egg can automatically generate a living creature. The author defines that inf... [more] | LOIS2018-16 IE2018-36 EMM2018-55 pp.31-36 |
| IT | 2018-07-19 16:20 |
Nara | Yamato Kaigishitsu | Easy Construction of Binary AIFV Codes for Unequal Letter Costs Takahiro Yoshida (The Univ. Tokyo), Hirosuke Yamamoto (Meiji Univ.) IT2018-18 |
In the case that the costs of letters (code symbols) 0 and 1 are equal, it is known that the AIFV code with two code tre... [more] | IT2018-18 pp.31-36 |
| ASN, NS, RCS, SR, RCC (Joint) |
2018-07-11 13:35 |
Hokkaido | Hakodate Arena | A Fundamental Approach for Efficient Crowdsourced Multi-view Video Uploading Than Than Nu (Osaka Univ), Takuya Fujihashi (Ehime Univ.), Takashi Watanabe (Osaka Univ.) ASN2018-23 |
The human visual system (HVS) has more sensitive spatial resolution to the currently gazing region-of-interest (ROI) o... [more] |
ASN2018-23 pp.43-46 |
| 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 |
| IN, RCS, NV (Joint) |
2018-05-11 11:10 |
Kanagawa | Keio University | [Invited Talk]
Lossy forwarding over non-orthogonal MAC channels Tadashi Matsumoto, Shen Qian (JAIST), Jiguang He (UOulu) IN2018-7 RCS2018-34 |
[more] | IN2018-7 RCS2018-34 p.35(IN), p.71(RCS) |
| 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 |
| WBS, IT, ISEC | 2018-03-08 13:25 |
Tokyo | Katsusika Campas, Tokyo University of Science | Optimality for the Iterative Construction Scheme of AIFV-$m$ codes Ryusei Fujita, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT2017-111 ISEC2017-99 WBS2017-92 |
Yamamoto, Tsuchihashi, and Honda proposed binary AIFV (almost instantaneous fixed-to-variable length) codes, which allow... [more] | IT2017-111 ISEC2017-99 WBS2017-92 pp.49-54 |
| ET | 2018-03-03 15:25 |
Kochi | Kochi University of Technology (Eikokuji Campus) | Yuta Nakamura, Hidetake Uwano (NIT,Nara) ET2017-116 |
Source code understanding is highly time consuming task. Software developers are required to implement "readable code" a... [more] | ET2017-116 pp.159-164 |
[Return to Top Page]