Ken-ichi Iwata

IEEE Trans. Inf. Theory, January, 2025

2024

Properties of k-Bit Delay Decodable Codes.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024

Reduction of Sufficient Number of Code Tables of k-Bit Delay Decodable Codes.

[BibT_eX]

[DOI]

CoRR, 2024

Encoding and Decoding Algorithms of ANS Variants and Evaluation of Their Average Code Lengths.

[BibT_eX]

[DOI]

CoRR, 2024

An Asymmetric Encoding - Decoding Scheme for Lossless Data Compression.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

AIFV Codes Allowing 2-bit Decoding Delays for Unequal Bit Cost.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

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

[BibT_eX]

[DOI]

CoRR, 2023

Properties of k-bit Delay Decodable Codes.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Optimality of Huffman Code in the Class of 1-Bit Delay Decodable Codes.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, December, 2022

Foreword.

[BibT_eX]

[DOI]

Hiroshi Kamabe

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

Enumeration and Coding of Binary AIFV-m Code Trees.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2022

Joint Coding for Discrete Sources and Finite-State Noiseless Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

AIVF Codes Based on Iterative Algorithm and Dynamic Programming.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

On the Optimality of Binary AIFV Codes with Two Code Trees.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Modular Arithmetic Erasure Channels and Their Multilevel Channel Polarization.

[BibT_eX]

[DOI]

Hiroshi Fujisaki

IEEE Trans. Inf. Theory, 2020

An Algorithm for Constructing the Optimal Code Trees for Binary Alphabetic AIFV-m Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

A Universal Data Compression Scheme based on the AIVF Coding Techniques.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

On a Redundancy of AIFV-m Codes for m =3, 5.

[BibT_eX]

[DOI]

Ryusei Fujita

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions.

[BibT_eX]

[DOI]

Hiroshi Fujisaki

Proceedings of the IEEE International Symposium on Information Theory, 2019

Enumeration and Coding of Compact Code Trees for Binary AIFV Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

An Iterative Algorithm to Optimize the Average Performance of Markov Chains with Finite States.

[BibT_eX]

[DOI]

Ryusei Fujita

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Extremality Between Symmetric Capacity and Gallager's Reliability Function E0 for Ternary-Input Discrete Memoryless Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Asymptotic Distribution of Multilevel Channel Polarization for a Certain Class of Erasure Channels.

[BibT_eX]

[DOI]

Hiroshi Fujisaki

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.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

An Optimality Proof of the Iterative Algorithm for AIFV-m Codes.

[BibT_eX]

[DOI]

Ryusei Fujita

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

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

[BibT_eX]

[DOI]

CoRR, 2017

An iterative algorithm to construct optimal binary AIFV-m codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Sharp bounds on Arimoto's conditional Rényi entropies between two distinct orders.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Optimal quantization of B-DMCs maximizing α-mutual information with monge property.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Relations Between Conditional Shannon Entropy and Expectation of ℓα-Norm.

[BibT_eX]

[DOI]

CoRR, 2016

Extremal Relations Between Shannon Entropy and ℓα-Norm.

[BibT_eX]

[DOI]

CoRR, 2016

A generalized erasure channel in the sense of polarization for binary erasure channels.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Information Theory Workshop, 2016

Extremal relations between shannon entropy and ℓα-norm.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Relations between conditional Shannon entropy and expectation of ℓα-norm.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 2015 Data Compression Conference, 2015

2014

Evaluation of Maximum Redundancy of Data Compression via Substring Enumeration for k-th Order Markov Sources.

[BibT_eX]

[DOI]

Yuki Shima

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Suboptimal quantizer design for outputs of discrete memoryless channels with a finite-input alphabet.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Shin-ya Ozawa

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.

[BibT_eX]

[DOI]

Hiroki Koga

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.

[BibT_eX]

[DOI]

Hiroki Koga

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

2012

On the maximum redundancy of CSE for I.I.D. sources.

[BibT_eX]

[DOI]

Yuki Shima

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Hiroki Koga

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

An Improvement in Lossless Data Compression via Substring Enumeration.

[BibT_eX]

[DOI]

Yuki Shima

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.

[BibT_eX]

[DOI]

Takuya Koyama

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

An Effective Optimization of Reference Pixel Arrangement in the Lossless Coding for HDTV image.

[BibT_eX]

[DOI]

Proceedings of the 9th IEEE/ACIS International Conference on Computer and Information Science, 2010

2006

L2-sensitivity minimization of one- and two-dimensional state-space digital filters subject to L2-scaling constraints.

[BibT_eX]

[DOI]

Takao Hinamoto

Wu-Sheng Lu

IEEE Trans. Signal Process., 2006

Optimal Synthesis of a Class of 2-D Digital Filters with Minimum L2-Sensitivity and No Overflow Oscillations.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

2005

Information-Spectrum Characterization of Multiple-Access Channels with Correlated Sources.

[BibT_eX]

[DOI]

Yasutada Oohama

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Information-Spectrum Characterization of Broadcast Channel with General Source.

[BibT_eX]

[DOI]

Yasutada Oohama

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

On multiple-access communication system for general correlated sources with an array of general independent channels.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Minimization of L2-sensitivity for a class of 2D state-space digital filters subject to L2-scaling constraints.

[BibT_eX]

[DOI]

Takao Hinamoto

Wu-Sheng Lu

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

State-space digital filters with minimum L2-sensitivity subject to L2-scaling constraints.

[BibT_eX]

[DOI]

Takao Hinamoto

Wu-Sheng Lu

Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

A New Approach of DCA by using BWT.

[BibT_eX]

[DOI]

Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

2002

An Information-Spectrum Approach to Rate-Distortion Function with Side Information.

[BibT_eX]

[DOI]