Tomohiko Uyematsu

112 papers A* 1B 33C 6Misc 1Journal 68Unranked 3
YearRankTypeTitle / Venue / Authors
2024 C conf
Capacity Region for Multiple-Access Channels Employing Relay Nodes.
ISITA
Kaito Suzuki, Tomohiko Uyematsu
2024 J jnl
Equivalences among Some Information Measures for Individual Sequences and Their Applications for Fixed-Length Coding Problems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tomohiko Uyematsu, Tetsunao Matsuta
2024 C conf
Simulation of Individual Sequences Using Training Data.
ISITA
Tomohiko Uyematsu
2022 J jnl
An Equivalent Expression for the Wyner-Ziv Source Coding Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tetsunao Matsuta, Tomohiko Uyematsu
2020 C conf
An Equivalent Expression for the Wyner-Ziv Source Coding Problem.
ISITA
Tetsunao Matsuta, Tomohiko Uyematsu
2020 J jnl
Coding Theorems for Asynchronous Slepian-Wolf Coding Systems.
IEEE Trans. Inf. Theory
Tetsunao Matsuta, Tomohiko Uyematsu
2019 J jnl
Achievable Rate Regions for Source Coding with Delayed Partial Side Information.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tetsunao Matsuta, Tomohiko Uyematsu
2019 J jnl
Coding Theorems for Asynchronous Slepian-Wolf Coding Systems.
CoRR
Tetsunao Matsuta, Tomohiko Uyematsu
2019 B conf
On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree.
ISIT
Tetsunao Matsuta, Tomohiko Uyematsu
2019 J jnl
On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree.
CoRR
Tetsunao Matsuta, Tomohiko Uyematsu
2018 C conf
Achievable Rate Regions for Source Coding with Delayed Partial Side Information.
ISITA
Tetsunao Matsuta, Tomohiko Uyematsu
2018 J jnl
An Information-Theoretical Analysis of the Minimum Cost to Erase Information.
CoRR
Tetsunao Matsuta, Tomohiko Uyematsu
2018 J jnl
An Information-Theoretical Analysis of the Minimum Cost to Erase Information.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tetsunao Matsuta, Tomohiko Uyematsu
2018 C conf
Error Exponents of Joint Channel Coding and Intrinsic Randomness for Memoryless Channels.
ISITA
Tomohiko Uyematsu, Tetsunao Matsuta
2018 J jnl
Joint Channel Coding and Intrinsic Randomness.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tomohiko Uyematsu, Tetsunao Matsuta
2018 J jnl
Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem.
CoRR
Tetsunao Matsuta, Tomohiko Uyematsu
2018 J jnl
Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tetsunao Matsuta, Tomohiko Uyematsu
2017 J jnl
Achievable Rate Regions of Cache-Aided Broadcast Networks for Delivering Content with a Multilayer Structure.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tetsunao Matsuta, Tomohiko Uyematsu
2017 B conf
On the minimum worst-case cost and the minimum average cost to erase information.
ITW
Tetsunao Matsuta, Tomohiko Uyematsu
2017 J jnl
Second-Order Intrinsic Randomness for Correlated Non-Mixed and Mixed Sources.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tomohiko Uyematsu, Tetsunao Matsuta
2016 B conf
Caching-aided multicast for partial information.
ISIT
Tetsunao Matsuta, Tomohiko Uyematsu
2016 J jnl
New Non-Asymptotic Bounds on Numbers of Codewords for the Fixed-Length Lossy Compression.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tetsunao Matsuta, Tomohiko Uyematsu
2015 — conf
Achievable rate regions for asynchronous Slepian-Wolf coding systems.
ITW Fall
Tetsunao Matsuta, Tomohiko Uyematsu
2015 J jnl
Key Rate of the B92 Quantum Key Distribution Protocol with Finite Qubits.
CoRR
Hiroaki Sasaki, Ryutaroh Matsumoto, Tomohiko Uyematsu
2015 B conf
Key rate of the B92 quantum key distribution protocol with finite qubits.
ISIT
Hiroaki Sasaki, Ryutaroh Matsumoto, Tomohiko Uyematsu
2015 B conf
Non-asymptotic bounds for fixed-length lossy compression.
ISIT
Tetsunao Matsuta, Tomohiko Uyematsu
2015 J jnl
Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding.
IEEE Trans. Inf. Theory
Jun Kurihara, Ryutaroh Matsumoto, Tomohiko Uyematsu
2015 B conf
Source coding with side information at the decoder revisited.
ISIT
Tomohiko Uyematsu, Tetsunao Matsuta
2014 C conf
Maximum multicast throughput by network coding on undirected hypernetworks.
ISITA
Hokuto Takahashi, Ryutaroh Matsumoto, Tomohiko Uyematsu
2014 J jnl
On the Wyner-Ziv Source Coding Problem with Unknown Delay.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tetsunao Matsuta, Tomohiko Uyematsu
2014 J jnl
Optimal axis compensation in quantum key distribution protocols over unital channels.
Theor. Comput. Sci.
Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu
2014 B conf
Rate-distortion functions for source coding when side information with unknown delay may be present.
ISIT
Tetsunao Matsuta, Tomohiko Uyematsu
2014 B conf
Revisiting the Slepian-Wolf coding problem for general sources: A direct approach.
ISIT
Tomohiko Uyematsu, Tetsunao Matsuta
2014 B conf
Revisiting the rate-distortion theory using smooth max Rényi divergence.
ITW
Tomohiko Uyematsu, Tetsunao Matsuta
2013 B conf
A general formula for capacity of channels with action-dependent states.
ISIT
Tetsunao Matsuta, Tomohiko Uyematsu
2013 B conf
A new unified method for intrinsic randomness problems of general sources.
ITW
Tomohiko Uyematsu, Shohei Kunimatsu
2013 J jnl
Random-Coding Exponential Error Bounds for Channels with Action-Dependent States.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tetsunao Matsuta, Tomohiko Uyematsu
2013 J jnl
Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
CoRR
Jun Kurihara, Ryutaroh Matsumoto, Tomohiko Uyematsu
2012 B conf
A general formula of rate-distortion functions for source coding with side information at many decoders.
ISIT
Tetsunao Matsuta, Tomohiko Uyematsu
2012 B conf
Explicit construction of universal strongly secure network coding via MRD codes.
ISIT
Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto
2012 J jnl
New Parameters of Linear Codes Expressing Security Performance of Universal Secure Network Coding
CoRR
Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto
2012 — conf
New parameters of linear codes expressing security performance of universal secure network coding.
Allerton Conference
Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto
2012 J jnl
Parametric Forms of the Achievable Rate Region for Source Coding with a Helper.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto
2012 J jnl
Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto
2011 J jnl
A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tetsunao Matsuta, Tomohiko Uyematsu
2011 J jnl
A Novel Realization of Threshold Schemes over Binary Field Extensions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Jun Kurihara, Tomohiko Uyematsu
2011 J jnl
A Universal Affine Code for Symmetric Channels.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tomohiko Uyematsu
2011 — conf
Strongly-secure secret sharing based on linear codes can be characterized by generalized hamming weight.
Allerton
Jun Kurihara, Tomohiko Uyematsu
2010 J jnl
A New Unified Method for Fixed-Length Source Coding Problems of General Sources.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tomohiko Uyematsu
2010 J jnl
Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast.
EURASIP J. Wirel. Commun. Netw.
Jasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber
2010 B conf
Relating source coding and resolvability: A direct approach.
ISIT
Tomohiko Uyematsu
2010 B conf
Secure key rate of the BB84 protocol using finite sample bits.
ISIT
Y. Sano, Ryutaroh Matsumoto, Tomohiko Uyematsu
2010 J jnl
Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu
2010 J jnl
Universal Coding of Ergodic Sources for Multiple Decoders with Side Information
CoRR
Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu
2010 J jnl
Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto
2010 B conf
Universal Slepian-Wolf source codes using low-density parity-check matrices.
ISIT
Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto
2010 B conf
Universal source coding for multiple decoders with side information.
ISIT
Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu
2010 J jnl
Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers
CoRR
Eitaro Shioji, Ryutaroh Matsumoto, Tomohiko Uyematsu
2010 J jnl
Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Eitaro Shioji, Ryutaroh Matsumoto, Tomohiko Uyematsu
2010 B conf
Vulnerability of MRD-code-based universal secure network coding against stronger eavesdroppers.
ISIT
Eitaro Shioji, Ryutaroh Matsumoto, Tomohiko Uyematsu
2009 B conf
Closed forms of the achievable rate region for Wyner's source coding systems.
ISIT
Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto
2009 J jnl
Decodability of Network Coding with Time-Varying Delay and No Buffering.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Terumasa Tateno, Ryutaroh Matsumoto, Tomohiko Uyematsu
2009 J jnl
Foreword.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tomohiko Uyematsu, Hirosuke Yamamoto
2009 J jnl
On the Energy Benefit of Network Coding for Wireless Multiple Unicast
CoRR
Jasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber
2009 B conf
On the energy benefit of network coding for wireless multiple unicast.
ISIT
Jasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber
2009 B conf
Optimal axis compensation in quantum key distribution protocols over unital channels.
ISIT
Tomohiko Uyematsu, Shun Watanabe, Ryutaroh Matsumoto
2009 J jnl
Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Masashi Naito, Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu
2009 J jnl
Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
CoRR
Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu
2009 B conf
Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code.
ISIT
Shun Watanabe, Tsuki Saitou, Ryutaroh Matsumoto, Tomohiko Uyematsu
2009 J jnl
Universal Source Coding OverGeneralized Complementary Delivery Networks.
IEEE Trans. Inf. Theory
Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka, Shun Watanabe
2008 J jnl
Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Shigeaki Kuzuoka, Tomohiko Uyematsu
2008 J jnl
Multiterminal source coding with complementary delivery
CoRR
Akisato Kimura, Tomohiko Uyematsu
2008 J jnl
Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels
CoRR
Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu
2008 B conf
Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels.
ISIT
Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu
2008 J jnl
Secret Key Agreement by Soft-decision of Signals in Gaussian Maurer's Model
CoRR
Masashi Naito, Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu
2008 B conf
Secret key agreement by reliability information of signals in Gaussian Maurer's Model.
ISIT
Masashi Naito, Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu
2008 J jnl
Universal Coding for Lossless and Lossy Complementary Delivery Problems
CoRR
Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu
2008 J jnl
Universal Multiterminal Source Coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case.
IEEE Trans. Inf. Theory
En-Hui Yang, Da-ke He, Tomohiko Uyematsu, Raymond W. Yeung
2008 B conf
Universal coding for lossy complementary delivery problem.
ISIT
Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu
2008 B conf
Universal coding theorem for relay channels.
ISIT
Toshifumi Sakai, Tomohiko Uyematsu
2007 B conf
Key rate of quantum key distribution with hashed two-way classical communication.
ISIT
Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu, Yasuhito Kawano
2007 J jnl
Universal Coding for Correlated Sources with Complementary Delivery.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka
2007 J jnl
Universal Lossy Coding for Individual Sequences Based on Complexity Functions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Shigeaki Kuzuoka, Tomohiko Uyematsu
2007 J jnl
Universal coding for correlated sources with complementary delivery
CoRR
Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka
2007 B conf
Universal coding for correlated sources with complementary delivery.
ISIT
Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka
2007 J jnl
Universal source coding over generalized complementary delivery networks
CoRR
Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka, Shun Watanabe
2006 J jnl
Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tomohiko Uyematsu, Fumio Kanaya
2006 J jnl
Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography.
IEEE Trans. Inf. Theory
Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu
2006 J jnl
Relationship among Complexities of Individual Sequences over Countable Alphabet.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Shigeaki Kuzuoka, Tomohiko Uyematsu
2005 J jnl
Efficient Secret Sharing Schemes Based on Authorized Subsets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Kouya Tochikubo, Tomohiko Uyematsu, Ryutaroh Matsumoto
2005 J jnl
Low-density parity-check matrices for coding of correlated sources.
IEEE Trans. Inf. Theory
Jun Muramatsu, Tomohiko Uyematsu, Tadashi Wadayama
2005 J jnl
Network Design and Cost Optimization for Label Switched Multilayer Photonic IP Networks.
IEEE J. Sel. Areas Commun.
S. Kaneda, Tomohiko Uyematsu, Naohide Nagatsu, Ken-ichi Sato
2005 B conf
Noise tolerance of the BB84 protocol with random privacy amplification.
ISIT
Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu
2005 J jnl
Primal-Dual Distance Bounds of Linear Codes with Application to Cryptography.
IACR Cryptol. ePrint Arch.
Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu
2005 J jnl
Primal-dual distance bounds of linear codes with application to cryptography
CoRR
Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu
2005 B conf
String matching-based universal source codes for source networks with asymptotically zero feedback.
ISIT
En-Hui Yang, Da-ke He, Tomohiko Uyematsu, Raymond W. Yeung
2004 B conf
Applicability of the sample path method of ergodic processes to individual sequences.
ISIT
Shigeaki Kuzuoka, Tomohiko Uyematsu
2004 J jnl
Maximum Mutual Information of Space-Time Block Codes with Symbolwise Decodability
CoRR
Kenji Tanaka, Ryutaroh Matsumoto, Tomohiko Uyematsu
2004 J jnl
Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder
CoRR
Takayuki Fukatani, Ryutaroh Matsumoto, Tomohiko Uyematsu
2004 J jnl
Weak variable-length Slepian-Wolf coding with linked encoders for mixed sources.
IEEE Trans. Inf. Theory
Akisato Kimura, Tomohiko Uyematsu
2003 J jnl
Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tomohiko Uyematsu, Shigeaki Kuzuoka
2003 J jnl
Foreword.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Masaaki Katayama, Tomohiko Uyematsu
2003 B conf
Low density parity check matrices for coding of multiple access networks.
ITW
Jun Muramatsu, Tomohiko Uyematsu, Tadashi Wadayama
2003 J jnl
Two Algorithms for Random Number Generation Implemented by Using Arithmetic of Limited Precision.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tomohiko Uyematsu, Yuan Li
2001 J jnl
An algebraic construction of codes for Slepian-Wolf source networks.
IEEE Trans. Inf. Theory
Tomohiko Uyematsu
2001 B conf
Weak variable-length Slepian-Wolf coding with linked encoders for mixed sources.
ITW
Akisato Kimura, Tomohiko Uyematsu
1999 J jnl
Channel simulation by interval algorithm: A performance analysis of interval algorithm.
IEEE Trans. Inf. Theory
Tomohiko Uyematsu, Fumio Kanaya
1997 J jnl
A construction of codes with exponential error bounds on arbitrary discrete memoryless channels.
IEEE Trans. Inf. Theory
Tomohiko Uyematsu, Eiji Okamoto
1995 J jnl
Permutation Cipher Scheme Using Polynomials over a Field.
IEICE Trans. Inf. Syst.
Eiji Okamoto, Tomohiko Uyematsu, Masahiro Mambo
1995 J jnl
Quantum communication with three coherent states.
IEEE Trans. Commun.
Tomohiko Uyematsu, Cherif Bendjaballah
1994 A* conf
Ciphertext Only Attack for One-way Function of the MAP Using One Ciphertext.
CRYPTO
Yukiyasu Tsunoo, Eiji Okamoto, Tomohiko Uyematsu
1986 Misc conf
A hierarchical classification of signals and corresponding approximation method based on minimum norm criterion.
ICASSP
Tomohiko Uyematsu, Kohichi Sakaniwa