default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomohiko Uyematsu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j47]Tomohiko Uyematsu, Tetsunao Matsuta:
Equivalences among Some Information Measures for Individual Sequences and Their Applications for Fixed-Length Coding Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(3): 393-403 (2024)- 2022
- [j46]Tetsunao Matsuta, Tomohiko Uyematsu:
An Equivalent Expression for the Wyner-Ziv Source Coding Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(3): 353-362 (2022) - 2020
- [j45]Tetsunao Matsuta
, Tomohiko Uyematsu:
Coding Theorems for Asynchronous Slepian-Wolf Coding Systems. IEEE Trans. Inf. Theory 66(8): 4774-4795 (2020) - [c42]Tetsunao Matsuta, Tomohiko Uyematsu:
An Equivalent Expression for the Wyner-Ziv Source Coding Problem. ISITA 2020: 21-25
2010 – 2019
- 2019
- [j44]Tetsunao Matsuta, Tomohiko Uyematsu:
Achievable Rate Regions for Source Coding with Delayed Partial Side Information. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(12): 1631-1641 (2019) - [c41]Tetsunao Matsuta, Tomohiko Uyematsu:
On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree. ISIT 2019: 2334-2338 - [i21]Tetsunao Matsuta, Tomohiko Uyematsu:
On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree. CoRR abs/1901.03039 (2019) - [i20]Tetsunao Matsuta, Tomohiko Uyematsu:
Coding Theorems for Asynchronous Slepian-Wolf Coding Systems. CoRR abs/1906.02929 (2019) - 2018
- [j43]Tomohiko Uyematsu, Tetsunao Matsuta:
Joint Channel Coding and Intrinsic Randomness. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2091-2098 (2018) - [j42]Tetsunao Matsuta, Tomohiko Uyematsu:
An Information-Theoretical Analysis of the Minimum Cost to Erase Information. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2099-2109 (2018) - [j41]Tetsunao Matsuta, Tomohiko Uyematsu:
Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2110-2124 (2018) - [c40]Tomohiko Uyematsu, Tetsunao Matsuta:
Error Exponents of Joint Channel Coding and Intrinsic Randomness for Memoryless Channels. ISITA 2018: 276-280 - [c39]Tetsunao Matsuta, Tomohiko Uyematsu:
Achievable Rate Regions for Source Coding with Delayed Partial Side Information. ISITA 2018: 369-373 - [i19]Tetsunao Matsuta, Tomohiko Uyematsu:
Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem. CoRR abs/1802.07458 (2018) - [i18]Tetsunao Matsuta, Tomohiko Uyematsu:
An Information-Theoretical Analysis of the Minimum Cost to Erase Information. CoRR abs/1802.07462 (2018) - 2017
- [j40]Tomohiko Uyematsu, Tetsunao Matsuta:
Second-Order Intrinsic Randomness for Correlated Non-Mixed and Mixed Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12): 2615-2628 (2017) - [j39]Tetsunao Matsuta, Tomohiko Uyematsu:
Achievable Rate Regions of Cache-Aided Broadcast Networks for Delivering Content with a Multilayer Structure. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(12): 2629-2640 (2017) - [c38]Tetsunao Matsuta, Tomohiko Uyematsu:
On the minimum worst-case cost and the minimum average cost to erase information. ITW 2017: 254-258 - 2016
- [j38]Tetsunao Matsuta, Tomohiko Uyematsu:
New Non-Asymptotic Bounds on Numbers of Codewords for the Fixed-Length Lossy Compression. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2116-2129 (2016) - [c37]Tetsunao Matsuta, Tomohiko Uyematsu:
Caching-aided multicast for partial information. ISIT 2016: 600-604 - 2015
- [j37]Jun Kurihara, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding. IEEE Trans. Inf. Theory 61(7): 3912-3936 (2015) - [c36]Hiroaki Sasaki, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Key rate of the B92 quantum key distribution protocol with finite qubits. ISIT 2015: 696-699 - [c35]Tomohiko Uyematsu, Tetsunao Matsuta:
Source coding with side information at the decoder revisited. ISIT 2015: 1570-1574 - [c34]Tetsunao Matsuta, Tomohiko Uyematsu:
Non-asymptotic bounds for fixed-length lossy compression. ISIT 2015: 1811-1815 - [c33]Tetsunao Matsuta, Tomohiko Uyematsu:
Achievable rate regions for asynchronous Slepian-Wolf coding systems. ITW Fall 2015: 312-316 - [i17]Hiroaki Sasaki, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Key Rate of the B92 Quantum Key Distribution Protocol with Finite Qubits. CoRR abs/1504.05628 (2015) - 2014
- [j36]Tetsunao Matsuta, Tomohiko Uyematsu:
On the Wyner-Ziv Source Coding Problem with Unknown Delay. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(12): 2288-2299 (2014) - [j35]Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Optimal axis compensation in quantum key distribution protocols over unital channels. Theor. Comput. Sci. 560: 91-106 (2014) - [c32]Tetsunao Matsuta, Tomohiko Uyematsu:
Rate-distortion functions for source coding when side information with unknown delay may be present. ISIT 2014: 936-940 - [c31]Tomohiko Uyematsu, Tetsunao Matsuta:
Revisiting the Slepian-Wolf coding problem for general sources: A direct approach. ISIT 2014: 1336-1340 - [c30]Hokuto Takahashi, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Maximum multicast throughput by network coding on undirected hypernetworks. ISITA 2014: 363-367 - [c29]Tomohiko Uyematsu, Tetsunao Matsuta:
Revisiting the rate-distortion theory using smooth max Rényi divergence. ITW 2014: 202-206 - 2013
- [j34]Tetsunao Matsuta, Tomohiko Uyematsu:
Random-Coding Exponential Error Bounds for Channels with Action-Dependent States. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(12): 2324-2331 (2013) - [c28]Tetsunao Matsuta, Tomohiko Uyematsu:
A general formula for capacity of channels with action-dependent states. ISIT 2013: 2473-2477 - [c27]Tomohiko Uyematsu, Shohei Kunimatsu:
A new unified method for intrinsic randomness problems of general sources. ITW 2013: 1-5 - [i16]Jun Kurihara, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding. CoRR abs/1301.5482 (2013) - 2012
- [j33]Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(11): 2067-2075 (2012) - [j32]Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Parametric Forms of the Achievable Rate Region for Source Coding with a Helper. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(12): 2493-2497 (2012) - [c26]Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto:
New parameters of linear codes expressing security performance of universal secure network coding. Allerton Conference 2012: 533-540 - [c25]Tetsunao Matsuta, Tomohiko Uyematsu:
A general formula of rate-distortion functions for source coding with side information at many decoders. ISIT 2012: 174-178 - [c24]Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Explicit construction of universal strongly secure network coding via MRD codes. ISIT 2012: 1483-1487 - [i15]Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto:
New Parameters of Linear Codes Expressing Security Performance of Universal Secure Network Coding. CoRR abs/1207.1936 (2012) - 2011
- [j31]Jun Kurihara, Tomohiko Uyematsu:
A Novel Realization of Threshold Schemes over Binary Field Extensions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(6): 1375-1380 (2011) - [j30]Tomohiko Uyematsu:
A Universal Affine Code for Symmetric Channels. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(11): 2097-2104 (2011) - [j29]Tetsunao Matsuta, Tomohiko Uyematsu:
A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(11): 2105-2120 (2011) - [c23]Jun Kurihara, Tomohiko Uyematsu:
Strongly-secure secret sharing based on linear codes can be characterized by generalized hamming weight. Allerton 2011: 951-957 - 2010
- [j28]Jasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber:
Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast. EURASIP J. Wirel. Commun. Netw. 2010 (2010) - [j27]Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(9): 1650-1659 (2010) - [j26]Tomohiko Uyematsu:
A New Unified Method for Fixed-Length Source Coding Problems of General Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 1868-1877 (2010) - [j25]Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 1878-1888 (2010) - [j24]Eitaro Shioji, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 2026-2033 (2010) - [c22]Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu:
Universal source coding for multiple decoders with side information. ISIT 2010: 1-5 - [c21]Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Universal Slepian-Wolf source codes using low-density parity-check matrices. ISIT 2010: 186-190 - [c20]Tomohiko Uyematsu:
Relating source coding and resolvability: A direct approach. ISIT 2010: 1350-1354 - [c19]Eitaro Shioji, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Vulnerability of MRD-code-based universal secure network coding against stronger eavesdroppers. ISIT 2010: 2433-2437 - [c18]Y. Sano, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Secure key rate of the BB84 protocol using finite sample bits. ISIT 2010: 2677-2681 - [i14]Eitaro Shioji, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers. CoRR abs/1003.1787 (2010) - [i13]Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu:
Universal Coding of Ergodic Sources for Multiple Decoders with Side Information. CoRR abs/1004.3085 (2010)
2000 – 2009
- 2009
- [j23]Masashi Naito, Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(2): 525-534 (2009) - [j22]Terumasa Tateno, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Decodability of Network Coding with Time-Varying Delay and No Buffering. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(8): 2141-2145 (2009) - [j21]Tomohiko Uyematsu, Hirosuke Yamamoto:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(10): 2391-2392 (2009) - [j20]Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka, Shun Watanabe:
Universal Source Coding OverGeneralized Complementary Delivery Networks. IEEE Trans. Inf. Theory 55(3): 1360-1373 (2009) - [c17]Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Closed forms of the achievable rate region for Wyner's source coding systems. ISIT 2009: 1214-1218 - [c16]Shun Watanabe, Tsuki Saitou, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code. ISIT 2009: 1298-1302 - [c15]Tomohiko Uyematsu, Shun Watanabe, Ryutaroh Matsumoto:
Optimal axis compensation in quantum key distribution protocols over unital channels. ISIT 2009: 1884-1888 - [c14]Jasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber:
On the energy benefit of network coding for wireless multiple unicast. ISIT 2009: 2567-2571 - [i12]Jasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber:
On the Energy Benefit of Network Coding for Wireless Multiple Unicast. CoRR abs/0901.2410 (2009) - [i11]Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code. CoRR abs/0906.2582 (2009) - 2008
- [j19]Shigeaki Kuzuoka, Tomohiko Uyematsu:
Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(3): 836-845 (2008) - [j18]En-Hui Yang, Da-ke He, Tomohiko Uyematsu, Raymond W. Yeung:
Universal Multiterminal Source Coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case. IEEE Trans. Inf. Theory 54(12): 5575-5590 (2008) - [c13]Toshifumi Sakai, Tomohiko Uyematsu:
Universal coding theorem for relay channels. ISIT 2008: 484-488 - [c12]Masashi Naito, Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Secret key agreement by reliability information of signals in Gaussian Maurer's Model. ISIT 2008: 727-731 - [c11]Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels. ISIT 2008: 2022-2025 - [c10]Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu:
Universal coding for lossy complementary delivery problem. ISIT 2008: 2177-2181 - [i10]Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu:
Universal Coding for Lossless and Lossy Complementary Delivery Problems. CoRR abs/0802.1567 (2008) - [i9]Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels. CoRR abs/0802.1785 (2008) - [i8]Akisato Kimura, Tomohiko Uyematsu:
Multiterminal source coding with complementary delivery. CoRR abs/0804.1602 (2008) - [i7]Masashi Naito, Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Secret Key Agreement by Soft-decision of Signals in Gaussian Maurer's Model. CoRR abs/0804.2940 (2008) - 2007
- [j17]Shigeaki Kuzuoka, Tomohiko Uyematsu:
Universal Lossy Coding for Individual Sequences Based on Complexity Functions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(2): 491-503 (2007) - [j16]Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka:
Universal Coding for Correlated Sources with Complementary Delivery. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(9): 1840-1847 (2007) - [c9]Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka:
Universal coding for correlated sources with complementary delivery. ISIT 2007: 1756-1760 - [c8]Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu, Yasuhito Kawano:
Key rate of quantum key distribution with hashed two-way classical communication. ISIT 2007: 2601-2605 - [i6]Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka:
Universal coding for correlated sources with complementary delivery. CoRR abs/0710.4187 (2007) - [i5]Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka, Shun Watanabe:
Universal source coding over generalized complementary delivery networks. CoRR abs/0710.4987 (2007) - 2006
- [j15]Shigeaki Kuzuoka, Tomohiko Uyematsu:
Relationship among Complexities of Individual Sequences over Countable Alphabet. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(7): 2047-2055 (2006) - [j14]Tomohiko Uyematsu, Fumio Kanaya:
Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(10): 2459-2465 (2006) - [j13]Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu:
Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography. IEEE Trans. Inf. Theory 52(9): 4251-4256 (2006) - 2005
- [j12]Kouya Tochikubo, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Efficient Secret Sharing Schemes Based on Authorized Subsets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(1): 322-326 (2005) - [j11]S. Kaneda, Tomohiko Uyematsu, Naohide Nagatsu, Ken-ichi Sato:
Network Design and Cost Optimization for Label Switched Multilayer Photonic IP Networks. IEEE J. Sel. Areas Commun. 23(8): 1612-1619 (2005) - [j10]Jun Muramatsu, Tomohiko Uyematsu, Tadashi Wadayama:
Low-density parity-check matrices for coding of correlated sources. IEEE Trans. Inf. Theory 51(10): 3645-3654 (2005) - [c7]Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Noise tolerance of the BB84 protocol with random privacy amplification. ISIT 2005: 1013-1017 - [c6]En-Hui Yang, Da-ke He, Tomohiko Uyematsu, Raymond W. Yeung:
String matching-based universal source codes for source networks with asymptotically zero feedback. ISIT 2005: 2349-2353 - [i4]Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu:
Primal-dual distance bounds of linear codes with application to cryptography. CoRR abs/cs/0506087 (2005) - [i3]Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu:
Primal-Dual Distance Bounds of Linear Codes with Application to Cryptography. IACR Cryptol. ePrint Arch. 2005: 194 (2005) - 2004
- [j9]Akisato Kimura, Tomohiko Uyematsu:
Weak variable-length Slepian-Wolf coding with linked encoders for mixed sources. IEEE Trans. Inf. Theory 50(1): 183-193 (2004) - [c5]Shigeaki Kuzuoka, Tomohiko Uyematsu:
Applicability of the sample path method of ergodic processes to individual sequences. ISIT 2004: 562 - [i2]Takayuki Fukatani, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder. CoRR cs.IT/0410040 (2004) - [i1]Kenji Tanaka, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Maximum Mutual Information of Space-Time Block Codes with Symbolwise Decodability. CoRR cs.IT/0410041 (2004) - 2003
- [j8]Masaaki Katayama, Tomohiko Uyematsu:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(10): 2427 (2003) - [j7]Tomohiko Uyematsu, Yuan Li:
Two Algorithms for Random Number Generation Implemented by Using Arithmetic of Limited Precision. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(10): 2542-2551 (2003) - [j6]Tomohiko Uyematsu, Shigeaki Kuzuoka:
Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(10): 2615-2617 (2003) - [c4]Jun Muramatsu, Tomohiko Uyematsu, Tadashi Wadayama:
Low density parity check matrices for coding of multiple access networks. ITW 2003: 304-307 - 2001
- [j5]Tomohiko Uyematsu:
An algebraic construction of codes for Slepian-Wolf source networks. IEEE Trans. Inf. Theory 47(7): 3082-3088 (2001) - [c3]Akisato Kimura, Tomohiko Uyematsu:
Weak variable-length Slepian-Wolf coding with linked encoders for mixed sources. ITW 2001: 82-84
1990 – 1999
- 1999
- [j4]Tomohiko Uyematsu, Fumio Kanaya:
Channel simulation by interval algorithm: A performance analysis of interval algorithm. IEEE Trans. Inf. Theory 45(6): 2121-2129 (1999) - 1997
- [j3]Tomohiko Uyematsu, Eiji Okamoto:
A construction of codes with exponential error bounds on arbitrary discrete memoryless channels. IEEE Trans. Inf. Theory 43(3): 992-996 (1997) - 1995
- [j2]Eiji Okamoto, Tomohiko Uyematsu, Masahiro Mambo:
Permutation Cipher Scheme Using Polynomials over a Field. IEICE Trans. Inf. Syst. 78-D(2): 138-142 (1995) - [j1]Tomohiko Uyematsu, Cherif Bendjaballah:
Quantum communication with three coherent states. IEEE Trans. Commun. 43(8): 2301-2304 (1995) - 1994
- [c2]Yukiyasu Tsunoo, Eiji Okamoto, Tomohiko Uyematsu:
Ciphertext Only Attack for One-way Function of the MAP Using One Ciphertext. CRYPTO 1994: 369-382
1980 – 1989
- 1986
- [c1]Tomohiko Uyematsu, Kohichi Sakaniwa:
A hierarchical classification of signals and corresponding approximation method based on minimum norm criterion. ICASSP 1986: 1637-1640
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
