default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKen-ichi Iwata
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j14]Kengo Hashimoto, Ken-ichi Iwata:
Properties of k-Bit Delay Decodable Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(3): 417-447 (2024)- 2022
- [j13]Ken-ichi Iwata, Hiroshi Kamabe:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3): 344 (2022) - [j12]Kengo Hashimoto
, Ken-ichi Iwata:
Optimality of Huffman Code in the Class of 1-Bit Delay Decodable Codes. IEEE J. Sel. Areas Inf. Theory 3(4): 616-625 (2022) - 2020
- [j11]Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki:
Modular Arithmetic Erasure Channels and Their Multilevel Channel Polarization. IEEE Trans. Inf. Theory 66(7): 3976-4006 (2020) - 2018
- [j10]Yuta Sakai, Ken-ichi Iwata:
Extremality Between Symmetric Capacity and Gallager's Reliability Function E0 for Ternary-Input Discrete Memoryless Channels. IEEE Trans. Inf. Theory 64(1): 163-191 (2018) - 2016
- [j9]Ken-ichi Iwata, Mitsuharu Arimura:
Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2130-2135 (2016) - 2014
- [j8]Ken-ichi Iwata, Mitsuharu Arimura, Yuki Shima:
Evaluation of Maximum Redundancy of Data Compression via Substring Enumeration for k-th Order Markov Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(8): 1754-1760 (2014) - 2013
- [j7]Mitsuharu Arimura, Hiroki Koga, Ken-ichi Iwata:
Redundancy-Optimal FF Codes for a General Source and Its Relationships to the Rate-Optimal FF Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(12): 2332-2342 (2013) - [j6]Mitsuharu Arimura, Hiroki Koga, Ken-ichi Iwata:
A Characterization of Optimal FF Coding Rate Using a New Optimistically Optimal Code. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(12): 2443-2446 (2013) - 2006
- [j5]Takao Hinamoto, Ken-ichi Iwata, Osemekhian I. Omoifo, Shuichi Ohno, Wu-Sheng Lu:
Optimal Synthesis of a Class of 2-D Digital Filters with Minimum L2-Sensitivity and No Overflow Oscillations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(7): 1987-1994 (2006) - [j4]Takao Hinamoto, Ken-ichi Iwata, Wu-Sheng Lu:
L2-sensitivity minimization of one- and two-dimensional state-space digital filters subject to L2-scaling constraints. IEEE Trans. Signal Process. 54(5): 1804-1812 (2006) - 2005
- [j3]Ken-ichi Iwata, Yasutada Oohama:
Information-Spectrum Characterization of Broadcast Channel with General Source. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(10): 2808-2818 (2005) - [j2]Ken-ichi Iwata, Yasutada Oohama:
Information-Spectrum Characterization of Multiple-Access Channels with Correlated Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(11): 3196-3202 (2005) - 2002
- [j1]Ken-ichi Iwata, Jun Muramatsu:
An Information-Spectrum Approach to Rate-Distortion Function with Side Information. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(6): 1387-1395 (2002)
Conference and Workshop Papers
- 2024
- [c38]Ken-ichi Iwata, Kengo Hashimoto, Takahiro Wakayama, Hirosuke Yamamoto:
AIFV Codes Allowing 2-bit Decoding Delays for Unequal Bit Cost. ISIT 2024: 49-54 - [c37]Hirosuke Yamamoto, Ken-ichi Iwata:
An Asymmetric Encoding - Decoding Scheme for Lossless Data Compression. ISIT 2024: 55-60 - 2022
- [c36]Ken-ichi Iwata, Hirosuke Yamamoto:
Joint Coding for Discrete Sources and Finite-State Noiseless Channels. ISIT 2022: 3327-3332 - [c35]Genta Onishi, Kengo Hashimoto, Ken-ichi Iwata, Hirosuke Yamamoto:
Enumeration and Coding of Binary AIFV-m Code Trees. ISITA 2022: 94-98 - 2021
- [c34]Ken-ichi Iwata, Hirosuke Yamamoto:
AIVF Codes Based on Iterative Algorithm and Dynamic Programming. ISIT 2021: 2018-2023 - [c33]Kengo Hashimoto, Ken-ichi Iwata:
On the Optimality of Binary AIFV Codes with Two Code Trees. ISIT 2021: 3173-3178 - 2020
- [c32]Ryusei Fujita, Ken-ichi Iwata, Hirosuke Yamamoto:
On a Redundancy of AIFV-m Codes for m =3, 5. ISIT 2020: 2355-2359 - [c31]Hirosuke Yamamoto, Koki Imaeda, Kengo Hashimoto, Ken-ichi Iwata:
A Universal Data Compression Scheme based on the AIVF Coding Techniques. ISIT 2020: 2360-2364 - [c30]Ken-ichi Iwata, Hirosuke Yamamoto:
An Algorithm for Constructing the Optimal Code Trees for Binary Alphabetic AIFV-m Codes. ITW 2020: 1-5 - 2019
- [c29]Kengo Hashimoto, Ken-ichi Iwata, Hirosuke Yamamoto:
Enumeration and Coding of Compact Code Trees for Binary AIFV Codes. ISIT 2019: 1527-1531 - [c28]Ryusei Fujita, Ken-ichi Iwata, Hirosuke Yamamoto:
An Iterative Algorithm to Optimize the Average Performance of Markov Chains with Finite States. ISIT 2019: 1902-1906 - [c27]Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki:
Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions. ISIT 2019: 2109-2113 - 2018
- [c26]Yuta Sakai, Ken-ichi Iwata:
Dynamic Programming Approach of Optimal Upgradation Algorithm for an Auxiliary Random Variable of a Bernoulli Random Variable. ISIT 2018: 146-150 - [c25]Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki:
Asymptotic Distribution of Multilevel Channel Polarization for a Certain Class of Erasure Channels. ISIT 2018: 856-860 - [c24]Ryusei Fujita, Ken-ichi Iwata, Hirosuke Yamamoto:
An Optimality Proof of the Iterative Algorithm for AIFV-m Codes. ISIT 2018: 2187-2191 - 2017
- [c23]Yuta Sakai, Ken-ichi Iwata:
Optimal quantization of B-DMCs maximizing α-mutual information with monge property. ISIT 2017: 2668-2672 - [c22]Yuta Sakai, Ken-ichi Iwata:
Sharp bounds on Arimoto's conditional Rényi entropies between two distinct orders. ISIT 2017: 2975-2979 - [c21]Hirosuke Yamamoto, Ken-ichi Iwata:
An iterative algorithm to construct optimal binary AIFV-m codes. ITW 2017: 519-523 - 2016
- [c20]Yuta Sakai, Ken-ichi Iwata:
Relations between conditional Shannon entropy and expectation of ℓα-norm. ISIT 2016: 1641-1645 - [c19]Yuta Sakai, Ken-ichi Iwata:
Extremal relations between shannon entropy and ℓα-norm. ISITA 2016: 428-432 - [c18]Ken-ichi Iwata, Hirosuke Yamamoto:
A dynamic programming algorithm to construct optimal code trees of AIFV codes. ISITA 2016: 641-645 - [c17]Yuta Sakai, Ken-ichi Iwata:
A generalized erasure channel in the sense of polarization for binary erasure channels. ITW 2016: 399-403 - 2015
- [c16]Ken-ichi Iwata, Mitsuharu Arimura:
Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet. DCC 2015: 452 - [c15]Yuta Sakai, Ken-ichi Iwata:
Feasible regions of symmetric capacity and Gallager's E0 function for ternary-input discrete memoryless channels. ISIT 2015: 81-85 - 2014
- [c14]Ken-ichi Iwata, Shin-ya Ozawa:
Quantizer design for outputs of binary-input discrete memoryless channels using SMAWK algorithm. ISIT 2014: 191-195 - [c13]Yuta Sakai, Ken-ichi Iwata:
Suboptimal quantizer design for outputs of discrete memoryless channels with a finite-input alphabet. ISITA 2014: 120-124 - 2012
- [c12]Mitsuharu Arimura, Ken-ichi Iwata:
On variable-to-fixed length coding of a general source with infinite alphabet. ISITA 2012: 485-488 - [c11]Ken-ichi Iwata, Mitsuharu Arimura, Yuki Shima:
On the maximum redundancy of CSE for I.I.D. sources. ISITA 2012: 489-492 - 2011
- [c10]Ken-ichi Iwata, Mitsuharu Arimura, Yuki Shima:
An Improvement in Lossless Data Compression via Substring Enumeration. ACIS-ICIS 2011: 219-223 - [c9]Hiroki Koga, Mitsuharu Arimura, Ken-ichi Iwata:
Coding theorems on the worst-case redundancy of fixed-length coding for a general source. ISIT 2011: 1327-1331 - 2010
- [c8]Yuya Yamaguchi, Takashi Otsuki, Ken-ichi Iwata, Shuichi Itoh:
An Effective Optimization of Reference Pixel Arrangement in the Lossless Coding for HDTV image. ACIS-ICIS 2010: 246-251 - [c7]Mitsuharu Arimura, Ken-ichi Iwata:
On the achievable redundancy rate of fixed length source code for general sources. ISIT 2010: 126-130 - [c6]Ken-ichi Iwata, Takuya Koyama:
A prefix-free coding for finite-state noiseless channels with small coding delay. ISITA 2010: 473-477 - [c5]Mitsuharu Arimura, Ken-ichi Iwata:
The minimum achievable redundancy rate of fixed-to-fixed length source codes for general sources. ISITA 2010: 595-600 - 2005
- [c4]Bo Zhao, Ken-ichi Iwata, Shuichi Itoh, Toshihiko Kato:
A New Approach of DCA by using BWT. DCC 2005: 495 - [c3]Takao Hinamoto, Ken-ichi Iwata, Wu-Sheng Lu:
State-space digital filters with minimum L2-sensitivity subject to L2-scaling constraints. ICASSP (4) 2005: 265-268 - [c2]Takao Hinamoto, Ken-ichi Iwata, Wu-Sheng Lu:
Minimization of L2-sensitivity for a class of 2D state-space digital filters subject to L2-scaling constraints. ISCAS (3) 2005: 2401-2404 - [c1]Ken-ichi Iwata:
On multiple-access communication system for general correlated sources with an array of general independent channels. ISIT 2005: 142-146
Informal and Other Publications
- 2024
- [i14]Hirosuke Yamamoto, Ken-ichi Iwata:
Encoding and Decoding Algorithms of ANS Variants and Evaluation of Their Average Code Lengths. CoRR abs/2408.07322 (2024) - [i13]Kengo Hashimoto, Ken-ichi Iwata:
Reduction of Sufficient Number of Code Tables of k-Bit Delay Decodable Codes. CoRR abs/2409.13287 (2024) - 2023
- [i12]Kengo Hashimoto, Ken-ichi Iwata:
Properties of k-bit Delay Decodable Codes. CoRR abs/2306.07563 (2023) - [i11]Kengo Hashimoto, Ken-ichi Iwata:
The Optimality of AIFV Codes in the Class of 2-bit Delay Decodable Codes. CoRR abs/2306.09671 (2023) - 2022
- [i10]Kengo Hashimoto, Ken-ichi Iwata:
Optimality of Huffman Code in the Class of 1-bit Delay Decodable Codes. CoRR abs/2209.08874 (2022) - 2019
- [i9]Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki:
Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions. CoRR abs/1904.11721 (2019) - 2018
- [i8]Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki:
Asymptotic Distribution of Multilevel Channel Polarization for a Certain Class of Erasure Channels. CoRR abs/1801.04422 (2018) - [i7]Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki:
Modular Arithmetic Erasure Channels and Their Multilevel Channel Polarization. CoRR abs/1804.09016 (2018) - 2017
- [i6]Yuta Sakai, Ken-ichi Iwata:
Sharp Bounds on Arimoto's Conditional Rényi Entropies Between Two Distinct Orders. CoRR abs/1702.00014 (2017) - [i5]Kees A. Schouhamer Immink, Stan Baggen, Ferdaous Chaabane, Yanling Chen, Peter H. N. de With, Héla Gassara, Hamed Gharbi, Adel Ghazel, Khaled Grati, Naira M. Grigoryan, Ashot N. Harutyunyan, Masayuki Imanishi, Mitsugu Iwamoto, Ken-ichi Iwata, Hiroshi Kamabe, Brian M. Kurkoski, Shigeaki Kuzuoka, Patrick Langenhuizen, Jan Lewandowsky, Akiko Manada, Shigeki Miyake, Hiroyoshi Morita, Jun Muramatsu, Safa Najjar, Arnak V. Poghosyan, Fatma Rouissi, Yuta Sakai, Ulrich Tamm, Joost van der Putten, Fons van der Sommen, A. J. Han Vinck, Tadashi Wadayama, Dirk Wübben, Hirosuke Yamamoto:
Proceedings of Workshop AEW10: Concepts in Information Theory and Communications. CoRR abs/1707.08567 (2017) - 2016
- [i4]Yuta Sakai, Ken-ichi Iwata:
Extremal Relations Between Shannon Entropy and ℓα-Norm. CoRR abs/1601.07678 (2016) - [i3]Yuta Sakai, Ken-ichi Iwata:
Relations Between Conditional Shannon Entropy and Expectation of ℓα-Norm. CoRR abs/1602.04577 (2016) - [i2]Yuta Sakai, Ken-ichi Iwata:
A Generalized Erasure Channel in the Sense of Polarization for Binary Erasure Channels. CoRR abs/1604.04413 (2016) - [i1]Yuta Sakai, Ken-ichi Iwata:
Sharp Bounds Between Two Rényi Entropies of Distinct Positive Orders. CoRR abs/1605.00019 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
