Tomohiko Uyematsu

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

2022

An Equivalent Expression for the Wyner-Ziv Source Coding Problem.

[BibT_eX]

[DOI]

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

2020

Coding Theorems for Asynchronous Slepian-Wolf Coding Systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

2019

Achievable Rate Regions for Source Coding with Delayed Partial Side Information.

[BibT_eX]

[DOI]

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

On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Joint Channel Coding and Intrinsic Randomness.

[BibT_eX]

[DOI]

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

Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem.

[BibT_eX]

[DOI]

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

An Information-Theoretical Analysis of the Minimum Cost to Erase Information.

[BibT_eX]

[DOI]

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

Error Exponents of Joint Channel Coding and Intrinsic Randomness for Memoryless Channels.

[BibT_eX]

[DOI]

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

2017

Second-Order Intrinsic Randomness for Correlated Non-Mixed and Mixed Sources.

[BibT_eX]

[DOI]

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

Achievable Rate Regions of Cache-Aided Broadcast Networks for Delivering Content with a Multilayer Structure.

[BibT_eX]

[DOI]

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

On the minimum worst-case cost and the minimum average cost to erase information.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

2016

New Non-Asymptotic Bounds on Numbers of Codewords for the Fixed-Length Lossy Compression.

[BibT_eX]

[DOI]

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

Caching-aided multicast for partial information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Achievable rate regions for asynchronous Slepian-Wolf coding systems.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Source coding with side information at the decoder revisited.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Key rate of the B92 quantum key distribution protocol with finite qubits.

[BibT_eX]

[DOI]

Hiroaki Sasaki

Proceedings of the IEEE International Symposium on Information Theory, 2015

Non-asymptotic bounds for fixed-length lossy compression.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Optimal axis compensation in quantum key distribution protocols over unital channels.

[BibT_eX]

[DOI]

Shun Watanabe

Theor. Comput. Sci., 2014

On the Wyner-Ziv Source Coding Problem with Unknown Delay.

[BibT_eX]

[DOI]

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

Revisiting the rate-distortion theory using smooth max Rényi divergence.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Maximum multicast throughput by network coding on undirected hypernetworks.

[BibT_eX]

[DOI]

Hokuto Takahashi

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

Revisiting the Slepian-Wolf coding problem for general sources: A direct approach.

[BibT_eX]

[DOI]

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

Rate-distortion functions for source coding when side information with unknown delay may be present.

[BibT_eX]

[DOI]

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

2013

Random-Coding Exponential Error Bounds for Channels with Action-Dependent States.

[BibT_eX]

[DOI]

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

A new unified method for intrinsic randomness problems of general sources.

[BibT_eX]

[DOI]

Shohei Kunimatsu

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

A general formula for capacity of channels with action-dependent states.

[BibT_eX]

[DOI]

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

2012

Parametric Forms of the Achievable Rate Region for Source Coding with a Helper.

[BibT_eX]

[DOI]

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

Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight.

[BibT_eX]

[DOI]

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

A general formula of rate-distortion functions for source coding with side information at many decoders.

[BibT_eX]

[DOI]

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

Explicit construction of universal strongly secure network coding via MRD codes.

[BibT_eX]

[DOI]

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

New parameters of linear codes expressing security performance of universal secure network coding.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

A Universal Affine Code for Symmetric Channels.

[BibT_eX]

[DOI]

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

A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback.

[BibT_eX]

[DOI]

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

A Novel Realization of Threshold Schemes over Binary Field Extensions.

[BibT_eX]

[DOI]

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

Strongly-secure secret sharing based on linear codes can be characterized by generalized hamming weight.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code.

[BibT_eX]

[DOI]

Shun Watanabe

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

A New Unified Method for Fixed-Length Source Coding Problems of General Sources.

[BibT_eX]

[DOI]

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

Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers.

[BibT_eX]

[DOI]

Eitaro Shioji

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

Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices.

[BibT_eX]

[DOI]

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

Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast.

[BibT_eX]

[DOI]

EURASIP J. Wirel. Commun. Netw., 2010

Universal Coding of Ergodic Sources for Multiple Decoders with Side Information

[BibT_eX]

[DOI]

CoRR, 2010

Relating source coding and resolvability: A direct approach.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Secure key rate of the BB84 protocol using finite sample bits.

[BibT_eX]

[DOI]

Y. Sano

Proceedings of the IEEE International Symposium on Information Theory, 2010

Universal source coding for multiple decoders with side information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Universal Source Coding OverGeneralized Complementary Delivery Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Foreword.

[BibT_eX]

[DOI]

Hirosuke Yamamoto

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

Decodability of Network Coding with Time-Varying Delay and No Buffering.

[BibT_eX]

[DOI]

Terumasa Tateno

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

Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model.

[BibT_eX]

[DOI]

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

Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Closed forms of the achievable rate region for Wyner's source coding systems.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

On the energy benefit of network coding for wireless multiple unicast.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Universal Multiterminal Source Coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources.

[BibT_eX]

[DOI]

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

Multiterminal source coding with complementary delivery

[BibT_eX]

[DOI]

CoRR, 2008

Universal Coding for Lossless and Lossy Complementary Delivery Problems

[BibT_eX]

[DOI]

CoRR, 2008

Universal coding theorem for relay channels.

[BibT_eX]

[DOI]

Toshifumi Sakai

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

Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels.

[BibT_eX]

[DOI]

Atsushi Okawado

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

Secret key agreement by reliability information of signals in Gaussian Maurer's Model.

[BibT_eX]

[DOI]

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

Universal coding for lossy complementary delivery problem.

[BibT_eX]

[DOI]

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

2007

Universal Lossy Coding for Individual Sequences Based on Complexity Functions.

[BibT_eX]

[DOI]

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

Universal Coding for Correlated Sources with Complementary Delivery.

[BibT_eX]

[DOI]

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

Universal source coding over generalized complementary delivery networks

[BibT_eX]

[DOI]

CoRR, 2007

Key rate of quantum key distribution with hashed two-way classical communication.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet.

[BibT_eX]

[DOI]

Fumio Kanaya

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

Relationship among Complexities of Individual Sequences over Countable Alphabet.

[BibT_eX]

[DOI]

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

2005

Low-density parity-check matrices for coding of correlated sources.

[BibT_eX]

[DOI]

Jun Muramatsu

Tadashi Wadayama

IEEE Trans. Inf. Theory, 2005

Network Design and Cost Optimization for Label Switched Multilayer Photonic IP Networks.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2005

Efficient Secret Sharing Schemes Based on Authorized Subsets.

[BibT_eX]

[DOI]

Kouya Tochikubo

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

String matching-based universal source codes for source networks with asymptotically zero feedback.

[BibT_eX]

[DOI]

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

Noise tolerance of the BB84 protocol with random privacy amplification.

[BibT_eX]

[DOI]

Shun Watanabe

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

2004

Weak variable-length Slepian-Wolf coding with linked encoders for mixed sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Maximum Mutual Information of Space-Time Block Codes with Symbolwise Decodability

[BibT_eX]

[DOI]

Kenji Tanaka

CoRR, 2004

Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder

[BibT_eX]

[DOI]

Takayuki Fukatani

CoRR, 2004

Applicability of the sample path method of ergodic processes to individual sequences.

[BibT_eX]

[DOI]

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

2003

Two Algorithms for Random Number Generation Implemented by Using Arithmetic of Limited Precision.

[BibT_eX]

[DOI]

Yuan Li

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

Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information.

[BibT_eX]

[DOI]

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

Foreword.

[BibT_eX]

[DOI]

Masaaki Katayama

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

Low density parity check matrices for coding of multiple access networks.

[BibT_eX]

[DOI]

Jun Muramatsu

Tadashi Wadayama

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2001

An algebraic construction of codes for Slepian-Wolf source networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

1999

Channel simulation by interval algorithm: A performance analysis of interval algorithm.

[BibT_eX]

[DOI]

Fumio Kanaya

IEEE Trans. Inf. Theory, 1999

1997

A construction of codes with exponential error bounds on arbitrary discrete memoryless channels.

[BibT_eX]

[DOI]

Eiji Okamoto

IEEE Trans. Inf. Theory, 1997

1995

Quantum communication with three coherent states.

[BibT_eX]

[DOI]

Cherif Bendjaballah

IEEE Trans. Commun., 1995

Permutation Cipher Scheme Using Polynomials over a Field.

[BibT_eX]

[DOI]

Eiji Okamoto

Masahiro Mambo

IEICE Trans. Inf. Syst., 1995

1994

Ciphertext Only Attack for One-way Function of the MAP Using One Ciphertext.

[BibT_eX]

[DOI]

Yukiyasu Tsunoo

Eiji Okamoto

Proceedings of the Advances in Cryptology, 1994

1986

A hierarchical classification of signals and corresponding approximation method based on minimum norm criterion.

[BibT_eX]

[DOI]