A hierarchical classification of signals and corresponding approximation method based on minimum norm criterion. - Tomohiko Uyematsu; Kohichi Sakaniwa (ICASSP, 1986)

Ciphertext Only Attack for One-way Function of the MAP Using One Ciphertext. - Yukiyasu Tsunoo; Eiji Okamoto; Tomohiko Uyematsu (CRYPTO, 1994)

Permutation Cipher Scheme Using Polynomials over a Field. - Eiji Okamoto; Tomohiko Uyematsu; Masahiro Mambo (IEICE Trans. Inf. Syst., 1995)

Quantum communication with three coherent states. - Tomohiko Uyematsu; Cherif Bendjaballah (IEEE Trans. Commun., 1995)

A construction of codes with exponential error bounds on arbitrary discrete memoryless channels. - Tomohiko Uyematsu; Eiji Okamoto (IEEE Trans. Inf. Theory, 1997)

Channel simulation by interval algorithm: A performance analysis of interval algorithm. - Tomohiko Uyematsu; Fumio Kanaya (IEEE Trans. Inf. Theory, 1999)

An algebraic construction of codes for Slepian-Wolf source networks. - Tomohiko Uyematsu (IEEE Trans. Inf. Theory, 2001)

Low density parity check matrices for coding of multiple access networks. - Jun Muramatsu; Tomohiko Uyematsu; Tadashi Wadayama (ITW, 2003)

Foreword. - Masaaki Katayama; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information. - Tomohiko Uyematsu; Shigeaki Kuzuoka (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

Two Algorithms for Random Number Generation Implemented by Using Arithmetic of Limited Precision. - Tomohiko Uyematsu; Yuan Li (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

Applicability of the sample path method of ergodic processes to individual sequences. - Shigeaki Kuzuoka; Tomohiko Uyematsu (ISIT, 2004)

Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder - Takayuki Fukatani; Ryutaroh Matsumoto; Tomohiko Uyematsu (CoRR, 2004)

Maximum Mutual Information of Space-Time Block Codes with Symbolwise Decodability - Kenji Tanaka 003; Ryutaroh Matsumoto; Tomohiko Uyematsu (CoRR, 2004)

Weak variable-length Slepian-Wolf coding with linked encoders for mixed sources. - Akisato Kimura; Tomohiko Uyematsu (IEEE Trans. Inf. Theory, 2004)

Noise tolerance of the BB84 protocol with random privacy amplification. - Shun Watanabe; Ryutaroh Matsumoto; Tomohiko Uyematsu (ISIT, 2005)

String matching-based universal source codes for source networks with asymptotically zero feedback. - En-Hui Yang; Da-ke He; Tomohiko Uyematsu; Raymond W. Yeung (ISIT, 2005)

Efficient Secret Sharing Schemes Based on Authorized Subsets. - Kouya Tochikubo; Tomohiko Uyematsu; Ryutaroh Matsumoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

Network Design and Cost Optimization for Label Switched Multilayer Photonic IP Networks. - S. Kaneda; Tomohiko Uyematsu; Naohide Nagatsu; Ken-ichi Sato (IEEE J. Sel. Areas Commun., 2005)

Low-density parity-check matrices for coding of correlated sources. - Jun Muramatsu; Tomohiko Uyematsu; Tadashi Wadayama (IEEE Trans. Inf. Theory, 2005)

Relationship among Complexities of Individual Sequences over Countable Alphabet. - Shigeaki Kuzuoka; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet. - Tomohiko Uyematsu; Fumio Kanaya (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography. - Ryutaroh Matsumoto; Kaoru Kurosawa; Toshiya Itoh; Toshimitsu Konno; Tomohiko Uyematsu (IEEE Trans. Inf. Theory, 2006)

Key rate of quantum key distribution with hashed two-way classical communication. - Shun Watanabe; Ryutaroh Matsumoto; Tomohiko Uyematsu; Yasuhito Kawano (ISIT, 2007)

Universal source coding over generalized complementary delivery networks - Akisato Kimura; Tomohiko Uyematsu; Shigeaki Kuzuoka; Shun Watanabe (CoRR, 2007)

Universal Coding for Correlated Sources with Complementary Delivery. - Akisato Kimura; Tomohiko Uyematsu; Shigeaki Kuzuoka (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007)

Universal Lossy Coding for Individual Sequences Based on Complexity Functions. - Shigeaki Kuzuoka; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007)

Universal coding for lossy complementary delivery problem. - Shigeaki Kuzuoka; Akisato Kimura; Tomohiko Uyematsu (ISIT, 2008)

Secret key agreement by reliability information of signals in Gaussian Maurer's Model. - Masashi Naito; Shun Watanabe; Ryutaroh Matsumoto; Tomohiko Uyematsu (ISIT, 2008)

Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels. - Atsushi Okawado; Ryutaroh Matsumoto; Tomohiko Uyematsu (ISIT, 2008)

Universal coding theorem for relay channels. - Toshifumi Sakai; Tomohiko Uyematsu (ISIT, 2008)

Universal Coding for Lossless and Lossy Complementary Delivery Problems - Shigeaki Kuzuoka; Akisato Kimura; Tomohiko Uyematsu (CoRR, 2008)

Multiterminal source coding with complementary delivery - Akisato Kimura; Tomohiko Uyematsu (CoRR, 2008)

Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources. - Shigeaki Kuzuoka; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

Universal Multiterminal Source Coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case. - En-Hui Yang; Da-ke He; Tomohiko Uyematsu; Raymond W. Yeung (IEEE Trans. Inf. Theory, 2008)

On the energy benefit of network coding for wireless multiple unicast. - Jasper Goseling; Ryutaroh Matsumoto; Tomohiko Uyematsu; Jos H. Weber (ISIT, 2009)

Closed forms of the achievable rate region for Wyner's source coding systems. - Tetsunao Matsuta; Tomohiko Uyematsu; Ryutaroh Matsumoto (ISIT, 2009)

Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code. - Shun Watanabe; Tsuki Saitou; Ryutaroh Matsumoto; Tomohiko Uyematsu (ISIT, 2009)

Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model. - Masashi Naito; Shun Watanabe; Ryutaroh Matsumoto; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

Decodability of Network Coding with Time-Varying Delay and No Buffering. - Terumasa Tateno; Ryutaroh Matsumoto; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

Foreword. - Tomohiko Uyematsu; Hirosuke Yamamoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

Universal Source Coding OverGeneralized Complementary Delivery Networks. - Akisato Kimura; Tomohiko Uyematsu; Shigeaki Kuzuoka; Shun Watanabe (IEEE Trans. Inf. Theory, 2009)

Universal source coding for multiple decoders with side information. - Shigeaki Kuzuoka; Akisato Kimura; Tomohiko Uyematsu (ISIT, 2010)

Secure key rate of the BB84 protocol using finite sample bits. - Y. Sano; Ryutaroh Matsumoto; Tomohiko Uyematsu (ISIT, 2010)

Relating source coding and resolvability: A direct approach. - Tomohiko Uyematsu (ISIT, 2010)

Universal Coding of Ergodic Sources for Multiple Decoders with Side Information - Shigeaki Kuzuoka; Akisato Kimura; Tomohiko Uyematsu (CoRR, 2010)

Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast. - Jasper Goseling; Ryutaroh Matsumoto; Tomohiko Uyematsu; Jos H. Weber (EURASIP J. Wirel. Commun. Netw., 2010)

Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices. - Tetsunao Matsuta; Tomohiko Uyematsu; Ryutaroh Matsumoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010)

Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers. - Eitaro Shioji; Ryutaroh Matsumoto; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010)

A New Unified Method for Fixed-Length Source Coding Problems of General Sources. - Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010)

Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code. - Shun Watanabe; Ryutaroh Matsumoto; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010)

Strongly-secure secret sharing based on linear codes can be characterized by generalized hamming weight. - Jun Kurihara; Tomohiko Uyematsu (Allerton, 2011)

A Novel Realization of Threshold Schemes over Binary Field Extensions. - Jun Kurihara; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

A Universal Affine Code for Symmetric Channels. - Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

New parameters of linear codes expressing security performance of universal secure network coding. - Jun Kurihara; Tomohiko Uyematsu; Ryutaroh Matsumoto (Allerton Conference, 2012)

Explicit construction of universal strongly secure network coding via MRD codes. - Jun Kurihara; Tomohiko Uyematsu; Ryutaroh Matsumoto (ISIT, 2012)

A general formula of rate-distortion functions for source coding with side information at many decoders. - Tetsunao Matsuta; Tomohiko Uyematsu (ISIT, 2012)

Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight. - Jun Kurihara; Tomohiko Uyematsu; Ryutaroh Matsumoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012)

Parametric Forms of the Achievable Rate Region for Source Coding with a Helper. - Tetsunao Matsuta; Tomohiko Uyematsu; Ryutaroh Matsumoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012)

A general formula for capacity of channels with action-dependent states. - Tetsunao Matsuta; Tomohiko Uyematsu (ISIT, 2013)

A new unified method for intrinsic randomness problems of general sources. - Tomohiko Uyematsu; Shohei Kunimatsu (ITW, 2013)

Random-Coding Exponential Error Bounds for Channels with Action-Dependent States. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)

Rate-distortion functions for source coding when side information with unknown delay may be present. - Tetsunao Matsuta; Tomohiko Uyematsu (ISIT, 2014)

Revisiting the Slepian-Wolf coding problem for general sources: A direct approach. - Tomohiko Uyematsu; Tetsunao Matsuta (ISIT, 2014)

Maximum multicast throughput by network coding on undirected hypernetworks. - Hokuto Takahashi; Ryutaroh Matsumoto; Tomohiko Uyematsu (ISITA, 2014)

Revisiting the rate-distortion theory using smooth max Rényi divergence. - Tomohiko Uyematsu; Tetsunao Matsuta (ITW, 2014)

On the Wyner-Ziv Source Coding Problem with Unknown Delay. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

Optimal axis compensation in quantum key distribution protocols over unital channels. - Shun Watanabe; Ryutaroh Matsumoto; Tomohiko Uyematsu (Theor. Comput. Sci., 2014)

Non-asymptotic bounds for fixed-length lossy compression. - Tetsunao Matsuta; Tomohiko Uyematsu (ISIT, 2015)

Key rate of the B92 quantum key distribution protocol with finite qubits. - Hiroaki Sasaki; Ryutaroh Matsumoto; Tomohiko Uyematsu (ISIT, 2015)

Source coding with side information at the decoder revisited. - Tomohiko Uyematsu; Tetsunao Matsuta (ISIT, 2015)

Achievable rate regions for asynchronous Slepian-Wolf coding systems. - Tetsunao Matsuta; Tomohiko Uyematsu (ITW Fall, 2015)

Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding. - Jun Kurihara; Ryutaroh Matsumoto; Tomohiko Uyematsu (IEEE Trans. Inf. Theory, 2015)

Caching-aided multicast for partial information. - Tetsunao Matsuta; Tomohiko Uyematsu (ISIT, 2016)

New Non-Asymptotic Bounds on Numbers of Codewords for the Fixed-Length Lossy Compression. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

On the minimum worst-case cost and the minimum average cost to erase information. - Tetsunao Matsuta; Tomohiko Uyematsu (ITW, 2017)

Achievable Rate Regions of Cache-Aided Broadcast Networks for Delivering Content with a Multilayer Structure. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017)

Second-Order Intrinsic Randomness for Correlated Non-Mixed and Mixed Sources. - Tomohiko Uyematsu; Tetsunao Matsuta (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017)

Error Exponents of Joint Channel Coding and Intrinsic Randomness for Memoryless Channels. - Tomohiko Uyematsu; Tetsunao Matsuta (ISITA, 2018)

An Information-Theoretical Analysis of the Minimum Cost to Erase Information. - Tetsunao Matsuta; Tomohiko Uyematsu (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. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Joint Channel Coding and Intrinsic Randomness. - Tomohiko Uyematsu; Tetsunao Matsuta (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree. - Tetsunao Matsuta; Tomohiko Uyematsu (ISIT, 2019)

Achievable Rate Regions for Source Coding with Delayed Partial Side Information. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Coding Theorems for Asynchronous Slepian-Wolf Coding Systems. - Tetsunao Matsuta; Tomohiko Uyematsu (IEEE Trans. Inf. Theory, 2020)

An Equivalent Expression for the Wyner-Ziv Source Coding Problem. - Tetsunao Matsuta; Tomohiko Uyematsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

Capacity Region for Multiple-Access Channels Employing Relay Nodes. - Kaito Suzuki; Tomohiko Uyematsu (ISITA, 2024)

Simulation of Individual Sequences Using Training Data. - Tomohiko Uyematsu (ISITA, 2024)

Equivalences among Some Information Measures for Individual Sequences and Their Applications for Fixed-Length Coding Problems. - Tomohiko Uyematsu; Tetsunao Matsuta (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024)