Get started
Author

Ken‐ichi Iwata

Observed names: Iwata, Ken-ichi, K. Iwata, K.-i. IWATA, K.-i. Iwata, Ken-Ichi Iwata, Ken-ich Iwata, Ken-ichi IWATA, Ken-ichi Iwata, Kenichi Iwata
Institution: University of Fukui
Observed institutions: University of Fukui, Shibaura Institute of Technology, Japan Advanced Institute of Science and Technology, University of Electro-Communications, Matsuyama Shinonome College, Matsuyama Shinonome Junior College, The University of Tokyo, Tokushima University
ORCID: 0000-0002-8838-375X
Observed ORCID: 0000-0002-8838-375X
OpenAlex ID: A5013763523
Quantizer design for outputs of binary-input discrete memoryless channels using SMAWK algorithm
2014 · Ken-ichi Iwata, Shin-ya Ozawa · IEEE International Symposium on Information Theory (ISIT) · 35
An information-spectrum approach to rate-distortion function with side information
2002 · K. Iwata · IEEE International Symposium on Information Theory (ISIT) · 25
Untitled
2012 · Onruthai Pinyakong, Kwankeaw Tiangda, et al. · ScienceAsia · 20
PDF
An Iterative Algorithm to Optimize the Average Performance of Markov Chains with Finite States
2019 · Ryusei Fujita, Ken-ichi Iwata, et al. · IEEE International Symposium on Information Theory (ISIT) · 19
An iterative algorithm to construct optimal binary AIFV-m codes
2017 · Ken-ichi Iwata, Hirosuke Yamamoto · IEEE Information Theory Workshop (ITW) · 18
A dynamic programming algorithm to construct optimal code trees of AIFV codes
2016 · Ken‐ichi Iwata, H. Yamamoto · International Symposium on Information Theory and its Applications · 18
An Optimality Proof of the Iterative Algorithm for AIFV-m Codes
2018 · Ryusei Fujita, Ken-Ichi Iwata, et al. · IEEE International Symposium on Information Theory (ISIT) · 15
Suboptimal quantizer design for outputs of discrete memoryless channels with a finite-input alphabet.
2014 · Yuta Sakai, Ken‐ichi Iwata · International Symposium on Information Theory and its Applications · 12
On the Optimality of Binary AIFV Codes with Two Code Trees
2021 · Kengo Hashimoto, Ken-ichi Iwata · IEEE International Symposium on Information Theory (ISIT) · 8
An Algorithm for Constructing the Optimal Code Trees for Binary Alphabetic AIFV-m Codes
2021 · Ken-ichi Iwata, Hirosuke Yamamoto · IEEE Information Theory Workshop (ITW) · 8
On a Redundancy of AIFV-m Codes for m =3,5
2020 · Ryusei Fujita, Ken-ichi Iwata, et al. · IEEE International Symposium on Information Theory (ISIT) · 8
Enumeration and Coding of Compact Code Trees for Binary AIFV Codes
2019 · Kengo Hashimoto, Ken-ichi Iwata, et al. · IEEE International Symposium on Information Theory (ISIT) · 8
Optimality of Huffman Code in the Class of 1-Bit Delay Decodable Codes
2022 · Kengo Hashimoto, Ken-ichi Iwata · IEEE Journal on Selected Areas in Information Theory · 7
PDF
Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet
2016 · Ken-ichi IWATA, Mitsuharu ARIMURA · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 7
Properties of k-Bit Delay Decodable Codes
2023 · Kengo HASHIMOTO, Ken-ichi IWATA · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 6
PDF
Optimal quantization of B-DMCs maximizing α-mutual information with monge property
2017 · Yuta Sakai, Ken-ichi Iwata · IEEE International Symposium on Information Theory (ISIT) · 6
An Improvement in Lossless Data Compression via Substring Enumeration
2011 · Ken-ichi Iwata, Mitsuharu Arimura, et al. · IEEE/ACIS International Conference on Computer and Information Science (ICIS) · 6
Information-Spectrum Characterization of Multiple-Access Channels with Correlated Sources
2005 · K.-i. IWATA · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 6
Information-Spectrum Characterization of Broadcast Channel with General Source
2005 · K.-i. IWATA · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 6
An Efficient Universal Coding Algorithm for Noiseless Channel with Symbols of Unequal Cost
1997 · Ken‐ichi Iwata, Masakatu Morii, et al. · Tokyo Tech Research Repository (Tokyo Institute of Technology) · 6
Evaluation of Maximum Redundancy of Data Compression via Substring Enumeration for k-th Order Markov Sources
2014 · Ken-ichi IWATA, Mitsuharu ARIMURA, et al. · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 5
AIVF Codes Based on Iterative Algorithm and Dynamic Programming
2021 · Ken-ichi Iwata, Hirosuke Yamamoto · IEEE International Symposium on Information Theory (ISIT) · 4
A Universal Data Compression Scheme based on the AIVF Coding Techniques
2020 · Hirosuke Yamamoto, Koki Imaeda, et al. · IEEE International Symposium on Information Theory (ISIT) · 4
A generalized erasure channel in the sense of polarization for binary erasure channels
2016 · Yuta Sakai, Ken-ichi Iwata · IEEE Information Theory Workshop (ITW) · 4
PDF
On the maximum redundancy of CSE for I.I.D. sources
2012 · Ken‐ichi Iwata, Mitsuharu Arimura, et al. · International Symposium on Information Theory and its Applications · 4
Works count: 77
Citation count: 306
H-index: 8
I10-index: 8
Year
Topic
Type