| 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 # | |
| RCC, ISEC, IT, WBS | 2023-03-15 13:25 |
Yamaguchi | (Primary: On-site, Secondary: Online) |
Generalized Unicity Distance and its Application to Y-00 Quantum Stream Cipher Masaki Sohma (Tamagawa Univ.), Osamu Hirota (Chuo Univ.)  IT2022-128 ISEC2022-107 WBS2022-125 RCC2022-125 |
Shannon proposed a theory to evaluate cryptographic functions based on the entropy theory he had developed in order to a... [more] | IT2022-128 ISEC2022-107 WBS2022-125 RCC2022-125 pp.378-385 |
| IT, ISEC, RCC, WBS | 2022-03-10 16:50 |
Online | Online | [Special Invited Talk]
A spread of Information Theory Researches Hirosuke Yamamoto (U.Tokyo) IT2021-103 ISEC2021-68 WBS2021-71 RCC2021-78 |
We look back on the research themes dealt with in our researches of information theory for 47 years, and think about the... [more] | IT2021-103 ISEC2021-68 WBS2021-71 RCC2021-78 pp.117-121 |
| SIP, IT, RCS | 2021-01-21 13:35 |
Online | Online | Channel Coding Theorem with Asymptotic Cost Constraint Allowing Decoding Error and Cost Overrun Masaki Hori, Mikihiko Nishiara (Shinshu Univ.) IT2020-83 SIP2020-61 RCS2020-174 |
We consider a problem where the cost is defined over the coding alphabet in the channel coding problem. Such a proble... [more] |
IT2020-83 SIP2020-61 RCS2020-174 pp.107-112 |
| RCS, NS (Joint) |
2018-12-21 16:10 |
Hiroshima | Onomichi City Hall | A Study on Power Allocation in Downlink Non-Orthogonal Multiple Access using Transmission Simulation Ryu Kitagawa, Fumio Takahata (Waseda Univ.) RCS2018-240 |
The non-orthogonal multiple access (NOMA) would be one of key technologies in the 5-th generation mobile communications ... [more] | RCS2018-240 pp.125-130 |
| CS, OCS (Joint) |
2018-01-29 16:25 |
Ehime | Ehime University | [Special Invited Talk]
Nonlinear Shannon Limit in Optical Fiber Transmission Akihiro Maruta (Osaka Univ.) CS2017-81 OCS2017-71 |
A derivation of the expression which describes nonlinear Shannon limit of optical fiber transmission system is introduce... [more] | CS2017-81 OCS2017-71 pp.13-18(CS), pp.25-30(OCS) |
| LOIS, ISEC, SITE | 2017-11-09 15:20 |
Kyoto | A study on Information
-- Tribute to Shannon and Dretski -- Ichiro Mizukoshi (IISEC/NTT East) ISEC2017-65 SITE2017-47 LOIS2017-42 |
In engineering sense, there is no argument that the definition of Information by Shannon is the foundation of current in... [more] | ISEC2017-65 SITE2017-47 LOIS2017-42 pp.95-98 |
|
| IT | 2017-07-14 10:00 |
Chiba | Chiba University | Asymptotic Tightness of The Shannon Lower Bound for R(D)
-- Another Proof for Self-Similar Memoryless Source -- Shingo Taguchi, Tsutomu Kawabata (UEC) IT2017-27 |
Although the asymptotic properties of the Shannon lower bound for the rate-distortion function are well known for contin... [more] | IT2017-27 pp.61-65 |
| IT, ISEC, WBS | 2016-03-10 15:55 |
Tokyo | The University of Electro-Communications | Fundamental Properties on a Secret-key Cryptosystem with Guessing Secrecy for Plaintexts and Keys Shota Kamiya, Hiroki Koga (Tsukuba Unv.) IT2015-123 ISEC2015-82 WBS2015-106 |
In this paper we consider a secret-key cryptosystem with a wiretapper who tries to guess the plaintext corresponding to ... [more] | IT2015-123 ISEC2015-82 WBS2015-106 pp.137-142 |
| IT, ISEC, WBS | 2016-03-11 14:05 |
Tokyo | The University of Electro-Communications | [Invited Talk]
Refined Analysis of Optimum Coding Rate for Channels with States Hideki Yagi (Univ. of Electro-Communications) IT2015-137 ISEC2015-96 WBS2015-120 |
There has been a recent trend of studies which analyze the fundamental limit of achievable coding rates by allowing some... [more] | IT2015-137 ISEC2015-96 WBS2015-120 pp.221-228 |
| RECONF | 2015-06-20 16:15 |
Kyoto | Kyoto University | A Technology Mapping Method for Scalable Logic Module Ryo Araki, Masahiro Iida, Motoki Amagasaki, Morihiro Kuga, Toshinori Sueyoshi (Kumamoto Univ) RECONF2015-27 |
In order to implement logic functions, conventional field-programmable gate arrays (FPGAs) employs look-up tables (LUTs)... [more] | RECONF2015-27 pp.147-152 |
| ISEC, IT, WBS | 2014-03-11 16:05 |
Aichi | Nagoya Univ., Higashiyama Campus | Coding Theorems for Shannon's Cipher System under Two New Secrecy Criteria Shun Kikuchi, Hiroki Koga (Univ. of Tsukuba) IT2013-95 ISEC2013-124 WBS2013-84 |
In this paper we consider the situation where $n$ plaintexts generated from a stationary memoryless source are encoded t... [more] | IT2013-95 ISEC2013-124 WBS2013-84 pp.261-268 |
| LQE, OCS, OPE | 2013-10-25 17:35 |
Fukuoka | Multi-dimensional modulation and demodulation schemes in coherent optical communication systems Shota Ishimura, Kazuro Kikuchi (Univ. of Tokyo) OCS2013-81 OPE2013-127 LQE2013-97 |
In newly-developed coherent optical communication systems, we can employ four-dimensional optical modulation including t... [more] | OCS2013-81 OPE2013-127 LQE2013-97 pp.159-164 |
|
| RECONF | 2013-09-19 09:25 |
Ishikawa | Japan Advanced Institute of Science and Technology | A LUT Architecture Based on Partial Function of Shannon Expansion Kyosei Yanagida, Motoki Amagasaki, Masahiro Iida, Morihiro Kuga, Toshinori Sueyoshi (Kumamoto Univ.) RECONF2013-27 |
In order to implement logic functions, conventional eld programmable gate arrays (FPGAs) employs look-up tables (LUTs) ... [more] | RECONF2013-27 pp.43-48 |
| IT, ISEC, WBS | 2013-03-07 10:55 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | On a channel-simulation scheme based on reverse Shannon theorem Daichi Nagai, Tomohiro Ogawa (Univ. of Electro- Comm.) IT2012-63 ISEC2012-81 WBS2012-49 |
Reverse Shannon theorem (RST) was established by Bennett et al. in 2002. RST shows that an arbitrarily given discrete m... [more] |
IT2012-63 ISEC2012-81 WBS2012-49 pp.7-11 |
| IT | 2012-09-27 16:15 |
Gunma | Kusatsu Seminar House | Analysis of Threshold Saturation for Spatially-Coupled MacKay-Neal Codes Naruomi Obata, Kenta Kasai, Kohichi Sakaniwa (Tokyo Tech) IT2012-34 |
The belief propagation (BP) threshold of spatially-coupled (SC) low-density parity-check (LDPC) codes is equal to the MA... [more] | IT2012-34 pp.19-24 |
| IT | 2011-09-30 14:30 |
Tokyo | Tokyo Institute of Technology | Several Questions on The Shannon's Information Theory
-- From the Experience to use Information Theories as Interdisciplinary Analysis Tools -- Kimiaki Tokumaru (System Engineer) IT2011-34 |
Claude Shannon (1916-2001) proposed his unique definitions for Entropy, Redundancy, Stochastic, Quantization, and influe... [more] | IT2011-34 pp.61-66 |
| PRMU | 2011-03-10 09:30 |
Ibaraki | Written languages are analogously processed, while spoken languages are digitally processed.
-- An Error Correction Request for Shannon's Information Theory and Pavlov's 'Conditional Reflexes' -- Kimiaki Tokumaru (System Engineer) PRMU2010-241 |
The author came to a hypothesis that the unique and fundamental difference between humans and non-human animals (NHA) is... [more] | PRMU2010-241 pp.25-30 |
|
| 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 |
| COMP | 2006-03-23 09:35 |
Tokyo | The University of Electro-Communications | Complexity of the pairing strategy for Shannon switching game Ryosuke Takahashi, Eiji Takimoto, Akira Maruoka (Tohoku Univ.) |
Shannon switching game is a game where two players alternately place stones on the vertices of a given graph. The first ... [more] | COMP2005-64 pp.7-14 |
| WBS, IT, ISEC | 2006-03-16 15:35 |
Aichi | Nagoya Univ. | [Invited Talk]
TBA Hirosuke Yamamoto (Univ. of Tokyo) |
The rate-distortion theory shows that the minimum coding rate $R$ to achieve a given distortion $D$ in lossy data comp... [more] | IT2005-74 ISEC2005-131 WBS2005-88 pp.57-62 |
[Return to Top Page]