Hirosuke Yamamoto

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

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

2020

On the Capacity of Symmetric M-User Gaussian Interference Channels With Feedback.

[BibT_eX]

[DOI]

Lan V. Truong

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

Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory.

[BibT_eX]

[DOI]

CoRR, 2019

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

[BibT_eX]

[DOI]

Kengo Hashimoto

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

Dynamic AIFV Coding.

[BibT_eX]

[DOI]

Tomotaka Hiraoka

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

Alphabetic AIFV Codes Constructed from Hu- Tucker codes.

[BibT_eX]

[DOI]

Tomotaka Hiraoka

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

Worst-case Redundancy of Optimal Binary AIFV Codes and Their Extended Codes.

[BibT_eX]

[DOI]

Weihua Hu

IEEE Trans. Inf. Theory, 2017

Posterior Matching for Gaussian Broadcast Channels with Feedback.

[BibT_eX]

[DOI]

Lan V. Truong

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

A Cheating-Detectable (k, L, n) Ramp Secret Sharing Scheme.

[BibT_eX]

[DOI]

Wataru Nakamura

Terence Chan

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

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

[BibT_eX]

[DOI]

CoRR, 2017

Variable-to-Fixed Length Homophonic Coding Suitable for Asymmetric Channel Coding.

[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

Application of Yamamoto-Itoh coding scheme to discrete memoryless broadcast channels.

[BibT_eX]

[DOI]

Shintaro Hara

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

Coding of binary AIFV code trees.

[BibT_eX]

[DOI]

Kentaro Sumigawa

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

Yariable-to-fixed length homophonie coding suitable for asymmetric channel coding.

[BibT_eX]

[DOI]

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

On optimal error exponents in noiseless channel identification.

[BibT_eX]

[DOI]

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

2016

Direct- or Fast-Access Decoding Schemes for VF Codes.

[BibT_eX]

[DOI]

Yuka Kuwaori

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

Variable-to-Fixed Length Homophonic Coding with a Modified Shannon-Fano-Elias Code.

[BibT_eX]

[DOI]

CoRR, 2016

A ramp threshold secret sharing scheme against cheating by substitution attacks.

[BibT_eX]

[DOI]

Wataru Nakamura

Terence Chan

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

Variable-to-fixed length homophonie coding with a modified Shannon-Fano-Elias code.

[BibT_eX]

[DOI]

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

Highly sensitive universal statistical test.

[BibT_eX]

[DOI]

Qiqiang Liu

Proceedings of the IEEE International Symposium on Information Theory, 2016

Tight upper bounds on the redundancy of optimal binary AIFV codes.

[BibT_eX]

[DOI]

Weihua Hu

Proceedings of the IEEE International Symposium on Information Theory, 2016

On optimal transmission strategies for channels with noiseless feedback.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Multiple Object Identification Coding.

[BibT_eX]

[DOI]

Masashi Ueda

IEEE Trans. Inf. Theory, 2015

Almost Instantaneous Fixed-to-Variable Length Codes.

[BibT_eX]

[DOI]

Masato Tsuchihashi

IEEE Trans. Inf. Theory, 2015

Almost Instantaneous Fix-to-Variable Length Codes.

[BibT_eX]

[DOI]

Masato Tsuchihashi

CoRR, 2015

On Using Feedback in a Gaussian Channel.

[BibT_eX]

[DOI]

CoRR, 2015

Construction of polar codes for channels with memory.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

FV polar coding for lossy compression with an improved exponent.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

On the capacity of symmetric Gaussian interference channels with feedback.

[BibT_eX]

[DOI]

Lan V. Truong

Proceedings of the IEEE International Symposium on Information Theory, 2015

Private information retrieval for coded storage.

[BibT_eX]

[DOI]

Terence H. Chan

Siu-Wai Ho

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Variable Length Lossy Coding Using an LDPC Code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

On using noisy feedback in a Gaussian channel.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2014

Identification codes to identify multiple objects.

[BibT_eX]

[DOI]

Masashi Ueda

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Noisy feedback improves the Gaussian channel reliability function.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Secure Multiplex Coding Attaining Channel Capacity in Wiretap Channels.

[BibT_eX]

[DOI]

Daisuke Kobayashi

Tomohiro Ogawa

IEEE Trans. Inf. Theory, 2013

Polar Coding Without Alphabet Extension for Asymmetric Models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Almost instantaneous FV codes.

[BibT_eX]

[DOI]

Xiaofeng Wei

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

2012

Coding Theorems for a (2, 2)-Threshold Scheme With Detectability of Impersonation Attacks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

On the reliability function for a noisy feedback Gaussian channel: Zero rate.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2012

On the Hardness of Subset Sum Problem from Different Intervals.

[BibT_eX]

[DOI]

Jun Kogure

Noboru Kunihiro

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

On Reliability Function of Gaussian Channel with Noisy Feedback: Zero Transmission Rate

[BibT_eX]

[DOI]

CoRR, 2012

Fast Linear-Programming decoding of LDPC codes over GF(2m).

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and its Applications, 2012

Polar coding without alphabet extension for asymmetric channels.

[BibT_eX]

[DOI]

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

On decoding error exponent of Gaussian channel with noisy feedback: Nonexponential number of messages.

[BibT_eX]

[DOI]

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

2011

Generalized Security Analysis of the Random Key Bits Leakage Attack.

[BibT_eX]

[DOI]

Jun Kogure

Noboru Kunihiro

Proceedings of the Information Security Applications - 12th International Workshop, 2011

Channel coding theorem for the number of guesses in decoding.

[BibT_eX]

[DOI]

Keishi Okudera

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

2010

On the reliability function for a BSC with noisy feedback.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2010

A Randomness Test Based on T-Complexity.

[BibT_eX]

[DOI]

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

Coding Theorems for Cheating-Detectable Secret Sharing Schemes with Two Shares

[BibT_eX]

[DOI]

CoRR, 2010

Error exponents of discrete memoryless channels and AWGN channels with noisy feedback.

[BibT_eX]

[DOI]

Akari Sato

Proceedings of the International Symposium on Information Theory and its Applications, 2010

Coding theorems for biometric systems.

[BibT_eX]

[DOI]

Manabu Koide

Proceedings of the IEEE International Symposium on Information Theory, 2010

Representative sequence selection in unsupervised anomaly detection using spectrum kernel with theoretical parameter setting.

[BibT_eX]

[DOI]

Stefan Skludarek

Proceedings of the International Conference on Machine Learning and Cybernetics, 2010

Data Compression Based on a Dictionary Method Using Recursive Construction of T-Codes.

[BibT_eX]

[DOI]

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

2009

Foreword.

[BibT_eX]

[DOI]

Tomohiko Uyematsu

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

A New Randomness Test Based on Linear Complexity Profile.

[BibT_eX]

[DOI]

Fumio Sato

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

Noisy feedback improves the BSC reliability function.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

A coding theorem for cheating-detectable (2, 2)-threshold blockwise secret sharing schemes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Separate network coding for private and common messages from one source to two sinks.

[BibT_eX]

[DOI]

Kunihiko Harada

Proceedings of the IEEE International Symposium on Information Theory, 2009

A differential equation method to derive the formulas of the T-complexity and the LZ-complexity.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Anomaly Detection Using Time Index Differences of Identical Symbols with and without Training Data.

[BibT_eX]

[DOI]

Stefan Skludarek

Proceedings of the Advanced Data Mining and Applications, 5th International Conference, 2009

2008

Coding Theorems for the Shannon Cipher System With a Guessing Wiretapper and Correlated Source Outputs.

[BibT_eX]

[DOI]

Yutaka Hayashi

IEEE Trans. Inf. Theory, 2008

On the zero-rate error exponent for a BSC with noisy feedback.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2008

Strongly Secure Linear Network Coding.

[BibT_eX]

[DOI]

Kunihiko Harada

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

On BSC, noisy feedback and three messages.

[BibT_eX]

[DOI]

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

2007

Optimal Multiple Assignments Based on Integer Programming in Secret Sharing Schemes with General Access Structures.

[BibT_eX]

[DOI]

Hirohisa Ogawa

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

Multiplex Coding of Bit Commitment Based on a Discrete Memoryless Channel.

[BibT_eX]

[DOI]

Daichi Isami

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Strongly secure ramp secret sharing schemes for general access structures.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

2005

Asymptotic properties on codeword lengths of an optimal FV code for general sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Asymptotic redundancy of the MTF scheme for stationary ergodic sources.

[BibT_eX]

[DOI]

Mitsuharu Arimura

IEEE Trans. Inf. Theory, 2005

Secure multiplex coding to attain the channel capacity in wiretap channels

[BibT_eX]

[DOI]

Daisuke Kobayashi

Tomohiro Ogawa

CoRR, 2005

Asymptotically Optimal Tree-based Group Key Management Schemes

[BibT_eX]

[DOI]

Hideyuki Sakai

CoRR, 2005

Asymptotic optimality of tree-based group key management schemes.

[BibT_eX]

[DOI]

Hideyuki Sakai

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

Strongly secure ramp secret sharing schemes.

[BibT_eX]

[DOI]

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

How to attain the ordinary channel capacity securely in wiretap channels.

[BibT_eX]

[DOI]

Daisuke Kobayashi

Tomohiro Ogawa

Proceedings of the IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005

2004

Optimal multiple assignments based on integer programming in secret sharing schemes.

[BibT_eX]

[DOI]

Hirohisa Ogawa

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

2003

A coding theorem for lossy data compression by LDPC codes.

[BibT_eX]

[DOI]

Yuko Matsunaga

IEEE Trans. Inf. Theory, 2003

A Construction Method of Visual Secret Sharing Schemes for Plural Secret Images.

[BibT_eX]

[DOI]

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

2002

The Optimal n-out-of-n Visual Secret Sharing Scheme for Gray-Scale Images.

[BibT_eX]

[DOI]

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

2001

Average-sense optimality and competitive optimality for almost instantaneous VF codes.

[BibT_eX]

[DOI]

Hidetoshi Yokoo

IEEE Trans. Inf. Theory, 2001

2000

A new recursive universal code of the positive integers.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

1997

Rate-distortion theory for the Shannon cipher system.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

1996

Source coding theory for a triangular communication system.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

1995

Competitive optimality of source codes.

[BibT_eX]

[DOI]

Tadaaki Itoh

IEEE Trans. Inf. Theory, 1995

1994

Coding theorems for Shannon's cipher system with correlated source outputs, and common information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

1991

A new asymptotically optimal code for the positive integers.

[BibT_eX]

[DOI]

Hiroshi Ochi

IEEE Trans. Inf. Theory, 1991

A coding theorem for secret sharing communication systems with two Gaussian wiretap channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

A new implementation of the Ziv-Lempel incremental parsing algorithm.

[BibT_eX]

[DOI]

Tsutomu Kawabata

IEEE Trans. Inf. Theory, 1991

1989

Coding theorem for secret sharing communication systems with two noisy channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

Evaluation of a retrieval system using content addressable memory.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1989

1988

A rate-distortion problem for a communication system with a secondary decoder to be hindered.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

1986

On secret sharing communication systems with two or three channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1986

1983

A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1983

Correction to 'Wyner-Ziv theory for a general function of the correlated sources' (Sep 82 803-807).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1983

1982

Wyner-Ziv theory for a general function of the correlated sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1982

1981

Source coding theory for cascade and branching communication systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1981

1980

Viterbi decoding algorithm for convolutional codes with repeat request.

[BibT_eX]

[DOI]

Kohji Itoh

IEEE Trans. Inf. Theory, 1980

Correction to 'Asymptotic Performance of a Modified Schalkwijk-Barron Scheme for Channels with Noiseless Feedback'.

[BibT_eX]

[DOI]

Kohji Itoh

IEEE Trans. Inf. Theory, 1980

1979

Asymptotic performance of a modified Schalkwijk-Barron scheme for channels with noiseless feedback (Corresp.).

[BibT_eX]

[DOI]