Ken-ichi Iwata

Orcid: 0000-0002-8838-375X

According to our database1, Ken-ichi Iwata authored at least 55 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Properties of <i>k</i>-Bit Delay Decodable Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024

2023
The Optimality of AIFV Codes in the Class of 2-bit Delay Decodable Codes.
CoRR, 2023

Properties of k-bit Delay Decodable Codes.
CoRR, 2023

2022
Optimality of Huffman Code in the Class of 1-Bit Delay Decodable Codes.
IEEE J. Sel. Areas Inf. Theory, December, 2022

Foreword.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022

Joint Coding for Discrete Sources and Finite-State Noiseless Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
AIVF Codes Based on Iterative Algorithm and Dynamic Programming.
Proceedings of the IEEE International Symposium on Information Theory, 2021

On the Optimality of Binary AIFV Codes with Two Code Trees.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Modular Arithmetic Erasure Channels and Their Multilevel Channel Polarization.
IEEE Trans. Inf. Theory, 2020

An Algorithm for Constructing the Optimal Code Trees for Binary Alphabetic AIFV-m Codes.
Proceedings of the IEEE Information Theory Workshop, 2020

A Universal Data Compression Scheme based on the AIVF Coding Techniques.
Proceedings of the IEEE International Symposium on Information Theory, 2020

On a Redundancy of AIFV-m Codes for m =3, 5.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Enumeration and Coding of Compact Code Trees for Binary AIFV Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

An Iterative Algorithm to Optimize the Average Performance of Markov Chains with Finite States.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Extremality Between Symmetric Capacity and Gallager's Reliability Function E<sub>0</sub> for Ternary-Input Discrete Memoryless Channels.
IEEE Trans. Inf. Theory, 2018

Asymptotic Distribution of Multilevel Channel Polarization for a Certain Class of Erasure Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Dynamic Programming Approach of Optimal Upgradation Algorithm for an Auxiliary Random Variable of a Bernoulli Random Variable.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

An Optimality Proof of the Iterative Algorithm for AIFV-m Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Proceedings of Workshop AEW10: Concepts in Information Theory and Communications.
CoRR, 2017

An iterative algorithm to construct optimal binary AIFV-m codes.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Sharp bounds on Arimoto's conditional Rényi entropies between two distinct orders.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Optimal quantization of B-DMCs maximizing α-mutual information with monge property.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Lossless Data Compression via Substring Enumeration for <i>k</i>-th Order Markov Sources with a Finite Alphabet.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Sharp Bounds Between Two Rényi Entropies of Distinct Positive Orders.
CoRR, 2016

Relations Between Conditional Shannon Entropy and Expectation of ℓ<sub>α</sub>-Norm.
CoRR, 2016

Extremal Relations Between Shannon Entropy and ℓ<sub>α</sub>-Norm.
CoRR, 2016

A generalized erasure channel in the sense of polarization for binary erasure channels.
Proceedings of the 2016 IEEE Information Theory Workshop, 2016

Extremal relations between shannon entropy and ℓα-norm.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

A dynamic programming algorithm to construct optimal code trees of AIFV codes.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Relations between conditional Shannon entropy and expectation of ℓα-norm.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Feasible regions of symmetric capacity and Gallager's E0 function for ternary-input discrete memoryless channels.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet.
Proceedings of the 2015 Data Compression Conference, 2015

2014
Evaluation of Maximum Redundancy of Data Compression via Substring Enumeration for <i>k</i>-th Order Markov Sources.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Suboptimal quantizer design for outputs of discrete memoryless channels with a finite-input alphabet.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Quantizer design for outputs of binary-input discrete memoryless channels using SMAWK algorithm.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
A Characterization of Optimal FF Coding Rate Using a New Optimistically Optimal Code.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Redundancy-Optimal FF Codes for a General Source and Its Relationships to the Rate-Optimal FF Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

2012
On the maximum redundancy of CSE for I.I.D. sources.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

On variable-to-fixed length coding of a general source with infinite alphabet.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

2011
Coding theorems on the worst-case redundancy of fixed-length coding for a general source.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

An Improvement in Lossless Data Compression via Substring Enumeration.
Proceedings of the 10th IEEE/ACIS International Conference on Computer and Information Science, 2011

2010
A prefix-free coding for finite-state noiseless channels with small coding delay.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

The minimum achievable redundancy rate of fixed-to-fixed length source codes for general sources.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

On the achievable redundancy rate of fixed length source code for general sources.
Proceedings of the IEEE International Symposium on Information Theory, 2010

An Effective Optimization of Reference Pixel Arrangement in the Lossless Coding for HDTV image.
Proceedings of the 9th IEEE/ACIS International Conference on Computer and Information Science, 2010

2006
L<sub>2</sub>-sensitivity minimization of one- and two-dimensional state-space digital filters subject to L<sub>2</sub>-scaling constraints.
IEEE Trans. Signal Process., 2006

Optimal Synthesis of a Class of 2-D Digital Filters with Minimum <i>L</i><sub>2</sub>-Sensitivity and No Overflow Oscillations.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

2005
Information-Spectrum Characterization of Multiple-Access Channels with Correlated Sources.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Information-Spectrum Characterization of Broadcast Channel with General Source.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

On multiple-access communication system for general correlated sources with an array of general independent channels.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Minimization of L<sub>2</sub>-sensitivity for a class of 2D state-space digital filters subject to L<sub>2</sub>-scaling constraints.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

State-space digital filters with minimum L<sub>2</sub>-sensitivity subject to L<sub>2</sub>-scaling constraints.
Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

A New Approach of DCA by using BWT.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

2002
An Information-Spectrum Approach to Rate-Distortion Function with Side Information.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002


  Loading...