« 植松友彦教授 | Main | 良い研究をするためのガイド »

2011年04月05日

2011年 発表論文

  • 情報源の固定長符号化におけるリスト復号法の信頼性関数 (下野、植松、松本), 電子情報通信学会 技術研究報告, IT2010-59, pp.31-36 (Jan. 2011).
  • 凸最適化とmin-sum復号によるLDPC符号の反復復号法 (老木、松本、植松), 電子情報通信学会 技術研究報告, IT2010-65, pp.67-72 (Jan. 2011).
  • 最多一致部分裂に基づくユニバーサル情報源符号化法の実用的なアルゴリズム (齋藤、松田、松本、植松), 電子情報通信学会 技術研究報告, IT2010-105, pp.243-248 (March 2011).
  • 「通信の数学的理論」その後の話：通信路符号化編 (植松), 2011年電子情報通信学会総合大会, 基礎・境界論文集, pp.ss13-ss16 (March 2011).
  • A Novel Realization of Threshold Schemes over Binary Field Extensions (J. Kurihara and T. Uyematsu), IEICE Trans. Fundamentals, vol.E94-A, no.6, pp.1375-1380 (June 2011).
Posted by 植松友彦 at 1:50 午後
Edited on: 2011年07月21日 1:51 午後
Categories: 発表論文

2010年04月12日

2010年 発表論文

  • MIMO通信における通信路とLDPC符号語の非線形最適化による同時推定(小林、松本、植松), 電子情報通信学会技術研究報告,IT2009-92, pp.135-140 (March 2010).
  • Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices(T. Matsuta, T. Uyematsu, and R. Matsumoto), 電子情報通信学会技術研究報告,IT2009-99, pp.181-186 (March 2010).
  • Smooth Renyi Entropy and Resolvability(T. Uyematsu), 電子情報通信学会技術研究報告,IT2009-101, pp.193-198 (March 2010).
  • 有限の標本ビットを用いたBB84プロトコルの安全な鍵レート(佐野、松本、植松), 電子情報通信学会技術研究報告,IT2009-138, pp.427-432 (March 2010).
  • BB84 プロトコルの鍵レートを最大にするビット送信確率(ソニー、松本、植松), 電子情報通信学会技術研究報告,IT2009-139, pp.433-438 (March 2010).
  • より強力な盗聴者に対するMRD符号に基づくユニバーサルセキュアネットワーク符号化の脆弱性(塩治、松本、植松), 電子情報通信学会技術研究報告,IT2009-143, pp.455-460 (March 2010).
  • Smooth Renyi Entropy and Intrinsic Randomness (T. Uyematsu), 電子情報通信学会技術研究報告, IT2010-5 (May 2010).
  • Universal source coding for multiple decoders with side information (S. Kuzuoka, A. Kimura, and T. Uyematsu), Proc. IEEE Int. Symp. on Inform. Theory, pp.1-5 (June 2010).
  • Universal Slepian-Wolf source codes using low-density parity-check matrices (T. Matsuta, T. Uyematsu, and R. Matsumoto), Proc. IEEE Int. Symp. on Inform. Theory, pp.186-190 (June 2010).
  • Relating source coding and resolvability: a direct approach (T. Uyematsu), Proc. IEEE Int. Symp. on Inform. Theory, pp.1350-1354 (June 2010).
  • Vulnerability of MRD-code-based universal secure network coding against eavesdroppers (E. Shioji, R. Matsumoto, and T. Uyematsu), Proc. IEEE Int. Symp. on Inform. Theory, pp.2433-2437 (June 2010).
  • Secure key rate of the BB84 protocol using finite sample bits (Y. Sano, R. Matsumoto, and T. Uyematsu), Proc. IEEE Int. Symp. on Inform. Theory, pp.2677-2681 (June 2010).
  • Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code (S. Watanabe, R. Matsumoto, and T. Uyematsu), IEICE Trans. Fundamentals, vol.E93-A, no.11, pp.1650-1659 (Sep. 2010).
  • Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast (J. Goseling, R. Matsumoto, T. Uyematsu, and J. Weber), EURASIP Journal on Wireless Communications and Networking, vol.2010, Article ID 605421 (2010).
  • A New Unified Method for Fixed-Length Source Coding Problems of General Sources (T.Uyematsu), IEICE Trans. Fundamentals, vol.E93-A, no.11, pp.1868-1877 (Nov. 2010).
  • Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices (T. Matsuta, T. Uyematsu and R. Matsumoto), IEICE Trans. Fundamentals, vol.E93-A, no.11, pp.1878-1888 (Nov. 2010).
  • Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers (E. Shioji, R. Matsumoto, and T. Uyematsu), IEICE Trans. Fundamentals, vol.E93-A, no.11, pp.2026-2033 (Nov. 2010).
  • Secure key rate of the BB84 protocol using finite sample bits (Y. Sano, R. Matsumoto, and T. Uyematsu), J. Phys. A: Math. Theor. vol.43, 495302 (2010).
  • A design method of universal codes based on mixed channels (T. Matsuta, T. Uyematsu, and R. Matsumoto), 第33回情報理論とその応用シンポジウム予稿集, pp.25-30 (Nov.-Dec. 2010).
Posted by 植松友彦 at 2:53 午後
Edited on: 2011年04月12日 5:46 午後
Categories: 発表論文

2009年11月02日

2009年 発表論文

  • Secret Key Agreement by Soft-Decision of Signals in Guassian Maurer's Model (M. Naito, S. Watanabe, R. Matsumoto, and T. Uyematsu), IEICE Trans. Fundamentals, E92-A, no.2, pp.525-534 (Feb. 2009).
  • Relationship among Conditional Complexities of Individual Sequences (Y. Tanaka, T. Uyematsu, and R. Matsumoto), 電子情報通信学会技術研究報告, IT2008-64 (March, 2009).
  • 最多一致に基づく符号化法のユニバーサル性の証明 (林、植松、松本), 電子情報通信学会技術研究報告, IT2008-96 (March, 2009).
  • Universal Lossless Source Coding Based on Sequential Grammar Transforms (M. Jono, T. Uyematsu, and R. Matsumoto), 電子情報通信学会技術研究報告, IT2008-98 (March, 2009).
  • Closed Forms of the Achievable Rate Region for Wyner's Source Coding Systems (T. Matsuta, T. Uyematsu, and R. Matsumoto), 電子情報通信学会技術研究報告, IT2008-100 (March, 2009).
  • Error Exponents for Wyner's Source Coding System (T. Matsuta, T. Uyematsu, and R. Matsumoto), 電子情報通信学会技術研究報告, IT2008-101 (March, 2009).
  • On the Admissible Rate Region of Slepian-Wolf Coding Problem with LDPC Code and Mismatched Decoder (K. Yamasaki, R. Matsumoto, and T. Uyematsu), 電子情報通信学会技術研究報告, IT2008-102 (March, 2009).
  • Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code (S. Watanabe, T. Saitou, R. Matsumoto, and T. Uyematsu), 電子情報通信学会技術研究報告, IT2008-103 (March, 2009).
  • Optimal Axis Compensation in Quantum Key Distribution Protocols (S. Watanabe, R. Matsumoto, and T. Uyematsu), 電子情報通信学会技術研究報告, IT2008-104 (March, 2009).
  • Universal Source Coding over Generalized Complementary Delivery Networks (A. Kimura, T. Uyematsu, S. Kuzuoka, and S. Watanabe), IEEE Trans. Inform. Theory, vol.55, no.3, pp.1360-1373 (March 2009).
  • Closed Forms of the Achievable Rate Region for Wyner's Source Coding Systems (T. Matsuta, T. Uyemastu, and R. Matsumoto), Proc. of 2009 IEEE Inter. Symp. on Information Theory, pp.1214-1218 (June-July, 2009).
  • Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code (S. Watanabe, T. Saitou, R. Matsumoto, and T. Uyematsu), Proc. of 2009 IEEE Inter. Symp. on Information Theory, pp. 1298-1302(June-July, 2009).
  • Optimal Axis Compensation in Quantum Key Distribution Protocols over Unital Channels (S. Watanabe, R. Matsumoto, and T. Uyematsu), Proc. of 2009 IEEE Inter. Symp. on Information Theory, pp.1884-1888 (June-July, 2009).
  • On the Energy Benefit of Network Coding for Wireless Multiple Unicast (J. Goseling, R. Matsumoto, and T. Uyematsu, and J. Weber), Proc. of 2009 IEEE Inter. Symp. on Information Theory, pp.2567-2571 (June-July, 2009).
  • Decodability of Network Coding with Time-Varying Delay and No Buffering (T. Tateno, R. Matsumoto, and T. Uyematsu), IEICE Trans. Fundamentals, E920A, no.8, pp.2141-2145 (Aug. 2009).
  • 最多一致に基づく符号化法のユニバーサル性の証明 (林、城野、植松、松本), 電子情報通信学会論文誌A, vol.J92-A, no.11, pp.935-941 (Nov. 2009).
  • Smooth Renyi Entropy and Fixed-Length Source Coding (T. Uyematsu), 第32回情報理論とその応用シンポジウム予稿集, pp.48-53 (Dec. 2009)
  • Universal Slepian-Wolf Source Encoders Constructed by LDPC Matrix with Maximum-Likelihood Decoding (T. Matsuta, T. Uyematsu, and R. Matsumoto), 第32回情報理論とその応用シンポジウム予稿集, pp.625-630 (Dec. 2009)
  • ユニバーサル情報源符号を用いたギャンブリング(鮎川、植松、松本), 第32回情報理論とその応用シンポジウム予稿集, pp.833-838 (Dec. 2009).
Posted by 植松友彦 at 3:15 午後
Edited on: 2011年01月24日 4:50 午後
Categories: 発表論文

2009年10月25日

2008年 発表論文

  1. Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources (S. Kuzuoka and T. Uyematsu), IEICE Trans. Fundamentals, E91-A, no.3, pp.836-845 (March 2008).
  2. Secret Key Agreement by Reliability Information of Signals in Gaussian Maurer's Model (M. Naito, S. Watanabe, R. Matsumoto, and T. Uyematsu), Proc. 2008 IEEE ISIT, pp.727-731 (July 2008).
  3. Near ML Detection Using Dijkstra's Algorithm with Bounded List Size over MIMO Channels (A. Okawado, R. Matsumoto, and T. Uyematsu), Proc. 2008 IEEE ISIT, pp.2022-2025 (July 2008).
  4. Universal Coding Theorem for Relay Channels (T. Sakai and T. Uyematsu), Proc. 2008 IEEE ISIT, pp.484-488 (July, 2008).
  5. Universal Coding for Lossy Complementary Delivery Problem (S. Kuzuoka, A. Kimura, and T. Uyematsu), Proc. 2008 IEEE ISIT, pp.2177-2181 (July 2008).
  6. Tomography Increases Key Rate of Quantum-Key-Distribution Protocols (S. Watanabe, R. Matsumoto, and T. Uyemastu), Phys, Rev. A, vol.78, no.4, pp.042316-1-11 (Oct. 2008).
  7. Universal Multiterminal Source Coding Algorithm with Asymptotically Zero Feedback: Fixed Database Case (E.-h.Yang, D. -K. He, T.Uyematsu, and R. W. Yeung), IEEE Trans. Inform. Theory, vol.54, no.12, pp.5575-5590 (Dec. 2008).
Posted by 植松友彦 at 10:43 午前
Edited on: 2009年11月02日 3:16 午後
Categories: 発表論文

2009年10月24日

2007年 発表論文

  1. Universal Lossy Coding for Individual Sequences Based on Complexity Functions (S.Kuzuoka and T. Uyemastu), IEICE Trans. Fundamentals, E90-A, no.2, pp.491-503 (Feb. 2007).
  2. Universal Coding for Correlated Sources with Complementary Delivery (A. Kimura, S. Kuzuoka, and T. Uyematsu), Proc. of 2007 IEEE ISIT, pp.1756-1760 (June 2007).
  3. Key Rate of Quantum Key Distribution with Hashed Two-Way Classical Communication (S. Watanabe, R. Matsumoto, T. Uyematsu, and Y. Kawano), Proc. of 2007 IEEE ISIT, pp.2601-2605 (June 2007).
  4. Universal Coding of Correlated Sources with Complementary Delivery (A. Kimura, S. Kuzuoka, and T. Uyematsu), IEICE Trans. Fundamentals, E90-A, no.9, pp.1840-1847 (Sep. 2007)
  5. Key Rate of Quantum Key Distribution with Hashed Two-Way Classical Communication (S. Watanabe, R. Matsumoto, T. Uyematsu, and Y. Kawano), Phys. Rev. A, vol.76, no.3, pp.032312-1-7 (Sep. 2007).
Posted by 植松友彦 at 4:57 午後
Edited on: 2009年10月25日 10:34 午前
Categories: 発表論文

2006年 発表論文

  1. Design of MPLS/GMPLS Multilayer Network Considering Protection and Restoration (W. Imajuku, T. Ohara, R. Takeshima, T.Uyematsu, and K. Sato), Proc. of Optical Fiber Communication Conference 2006, p.3 (March 2006).
  2. Relationship among Complexities of Individual Sequences over Countable Alphabet (S. Kuzuoka and T. Uyematsu), IEICE Trans. Fundamentals, E89-A, no.7, to appear (July 2006).
  3. Security of Quantum Key Distribution Protocol with Two-Way Classical Communication Assisted by One-Time Pad Encryption (S. Watanabe, R. Matsumoto, and T. Uyematsu), Proc. Asian Conf. on Quantum Inform. Science 2006 (Sep. 2006).
  4. Primal-Dual Distance Bounds of Linear Codes with Application to Cryptography (R. Matsumoto, K. Kurosawa, T. Itoh, T. Konno, and T. Uyematsu), IEEE Trans. Inform. Theory, vol.52, no.9, pp.4251-4256 (sep. 2006).
  5. Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet (T. Uyematsu and F. Kanaya), IEICE Trans. Fundamentals, E89-A, no.10, pp.2459-2465 (Oct. 2006).
  6. Improvement of Stabilizer-Based Entanglement Distillation Protocols by Encoding Operators (S. Watanabe, R. Matsumoto, and T. Uyematsu), Journal of Physics A: Mathematical and General, vol.39, pp.4273-4290 (2006).
  7. Fixed-Slope Universal Lossy Coding for Individual Sequences (S. Kuzuoka and T. Uyematsu), Proc. of IEEE Inform. Theory Workshop 2006, pp.244-248 (Oct. 2006).
  8. Multiterminal Source Coding with Complementary Delivery (A. Kimura and T. Uyematsu), Proc. of 2006 ISITA, pp.189-194 (Oct. 2006).
  9. Universal Lossy Coding for Individual Sequences Based on Complexity Functions (S. Kuzuoka and T. Uyematsu), Proc. of 2006 ISITA, pp.290-295 (Oct. 2006).
  10. Linear-Time Encodable and Decodable Codes for Slepian-Wolf Source Networks (T. Uyematsu), Proc. 2006 ISITA, pp.313-318 (Oct. 2006).
  11. Sphere Decoder for Imperfect Channel State Estimation (C. Koike, R. Matsumoto, and T. Uyematsu), Proc. 2006 ISITA, pp.466-470 (Oct. 2006).
  12. Noise Torelance of the BB84 Protocol with Random Privacy Amplification (S. Watanabe, R. Matsumoto, and T. Uyematsu), International Journal on Quantum Information, vol.4, no.6, pp.935-946 (Dec. 2006).
Posted by 植松友彦 at 4:41 午後
Edited on: 2009年10月25日 10:34 午前
Categories: 発表論文

2005年 発表論文

  1. Efficient Secret Sharing Schemes Based on Authorized Subsets (K. Tochikubo, T. Uyematsu and R. Matsumoto), IEICE Trans. Fundamentals, E88-A, no.1, pp.322-326 (Jan. 2005).
  2. Network Design and Cost Optimization for Label Switched Multi-Layer Photonic IP Networks (S. Kaneda, T. Uyematsu, N. Nagatsu, and K. Sato), IEEE Jour. on Selected Areas in Commun., vol.23, no.8, pp.1612-1619 (Aug. 2005).
  3. Randomness of Individual Sequences (T. Uyematsu), presented at IEEE ITW2005 recent result session (2005).
  4. Noise Tolerance of the BB84 Protocol with Random Privacy Amplification (S. Watanabe, R. Matsumoto, and T. Uyematsu), Proc. of 2005 IEEE Int. Symp. on Inform. Theory, pp.1013-1017 (Sep. 2005).
  5. String Matching-Based Universal Source Codes for Source Networks with Asympotically Zero Feedback (E.-H. Yang, D.-K. He, T. Uyematsu, and R. W. Yeung), Proc. of 2005 IEEE Int. Symp. on Inform. Theory, pp.2349-2353 (Sep. 2005).
  6. Low Density Parity Check Matrices for Coding of Correlated Sources (J. Muramatsu, T. Uyematsu, and T. Wadayama), IEEE Trans. on Inform. Theory, vol.50, no.10, pp.3645-3654 (Oct. 2005).
Posted by 植松友彦 at 4:41 午後
Categories: 発表論文

2004年 発表論文

  1. Weak Variable-Length Slepian-Wolf Coding with Linked Encoders for Mixed Sources (A. Kimura and T. Uyematsu), IEEE Trans. Inform. Theory, vol.50, no.1, pp.183-193 (Jan. 2004).
  2. [招待論文]情報源のコスト付き符号化とその応用(植松), 電子情報通信学会論文誌(A), J87-A, No.5, pp.588-596 (平成16年5月).
  3. Secret Key Capacity for Ergodic Correlated Sources (K. Tochikubo, T. Uyematsu and R. Matsumoto), IEICE Trans. Fundamentals, E87-A, no.6, pp.1651-1654 (June, 2004).
  4. Applicability of the Sample Path Method of Ergodic Processes to Individual Sequences (S. Kuzuoka and T. Uyematsu), Proc. of 2004 IEEE ISIT, p.561 (June-July, 2004).
  5. Network Design for Multi-Layered Photonic IP Networks Considering IP Traffic Growth (S. Kaneda, T. Uyematsu, N. Nagatsu, K. Sato), IEICE Trans. Commun, E87-B, no.2, pp.302-309 (Feb. 2004).
  6. Two methods for decreasing the computational complexity of the MIMO ML decoder (T. Fukatani, R. Matsumoto and T. Uyematsu), IEICE Trans. Fundamentals, E87-A, no.10, pp.2571-2576 (Oct. 2004).
  7. Maximumn Mutual Information of Space-Time Block Codes with Symbolwise Decodability (K. Tanaka, R. Matsumoto, and T. Uyematsu), Proc. of 2004 ISITA, pp.1025-1030 (October, 2004).
  8. Relationship among Complexities of Individual Sequences over Countable Alphabet (S. Kuzuoka and T. Uyematsu), Proc. of 2004 ISITA, pp.1416-1421 (October, 2004).
  9. Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder (T. Fukatani, R. Matsumoto, and T. Uyematsu), Proc. of 2004 ISITA, pp.1507-1510 (October, 2004).
  10. Performance of Multistage Universal Decoder for Given Linear Codes over Additive Noise Channels (T. Uyematsu and F. Kanaya), Proc. of 2004 ISITA, pp.1585-1591 (October, 2004).
Posted by 植松友彦 at 4:40 午後
Categories: 発表論文

発表論文リスト(1999-2005)

学会論文誌 国際会議
  • Large Deviations Performance of Interval Alogorithm for Random Number Generation (A. Kimura and T. Uyematsu), Proc. of Memoryal Workshop for the 50th Anniversary of the Shannon Theory, pp.1-4 (Jan. 1999).
  • Channel Simulation by Interval Algorithm (T. Uyematsu and F. Kanaya), Proc. of the 1999 IEEE Inform. Theory and Comm. Workshop, p.98 (June 1999).
  • Almost Sure Convergence Theorems of Rate of Coin Tosses for Random Number Generation by Interval Algorithm (T. Uyematsu and F. Kanaya), Proc. of IEEE ISIT 2000, p.457 (June 2000).
  • Universal Coding for Correlated Sources with Memory (T. Uyematsu), Proc. of The Seventh Canadian Workshop on Information Theory, pp.40-43 (June 2001).
  • Weak Variable-Length Slepian-Wolf Coding with Linked Encoders for Mixed Sources (A. Kimura and T. Uyematsu), Proc. of 2001 IEEE Information Theory Workshop, pp.82-84 (Sep. 2001).
  • Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet (T. Uyematsu and F. Kanaya), Proc. of 2002 IEEE ISIT, p.122 (July 2002).
  • Network Dimensioning of Electrical/Optical Label Swithed Multi-Layer Photonic IP Networks (S. Kaneda, T. Uyematsu, N. Nagatsu and K. Sato), Proc. of 7th European Conference on Network and Optical Communications 2002, pp.14-21 (June 2002).
  • Universal Data Compression Algorithm with Side Information Based on LZW Algorithm (S. Kuzuoka, T. Uyematsu and R. Matsumoto), Proc. of ISITA 2002, pp.783-786 (Oct. 2002).
  • Low Density Parity Check Matrices for Coding of Multiple Access Networks (J. Muramatsu, T. Uyematsu and T. Wadayama), Proc. of the 2003 IEEE Inform. Theory Workshop, pp.304-307 (March-April, 2003).
  • Secret Key Capacity for Ergodic Correlated Sources (K. Tochikubo, T. Uyematsu and R. Matsumoto), Proc. of The Eighth Canadian Workshop on Infrom. Theory, pp.8-11 (May 2003).
  • Asymptotical Optimality of Grammar-Based Codes for Nonstationary Sources (T. Uyematsu and N. Shiota), Proc. of 3rd Asia-Europe Workshop on Information Theory, pp.49-52 (June 2003).
  • On the Universality of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet (T. Uyematsu and F. Kanaya), Proc. of 3rd Asia-Europe Workshop on Information Theory, pp.79-83 (June 2003).
  • The Burrows Wheeler Transform Asymptotically Conserves the Ziv-Entropy of Almost Every Sequence from an Ergodic Source (F. Kanaya and T. Uyematsu), Proc. of 2003 IEEE ISIT, p.23 (June-July, 2003).
  • Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information (T. Uyematsu and S. Kuzuoka), Proc. of 2003 IEEE ISIT, p.142 (June-July, 2003).
  • Low Density Parity Check Matrices for Coding of Correlated Sources (J. Muramatsu, T. Uyematsu and T. Wadayama), Proc. of 2003 IEEE ISIT, p.173 (June-July, 2003).
  • Applicability of the Sample Path Method of Ergodic Processes to Individual Sequences (S. Kuzuoka and T. Uyematsu), Proc. of 2004 IEEE ISIT, p.561 (June-July, 2004).
  • Maximumn Mutual Information of Space-Time Block Codes with Symbolwise Decodability (K. Tanaka, R. Matsumoto, and T. Uyematsu), Proc. of 2004 ISITA, pp.1025-1030 (October, 2004).
  • Relationship among Complexities of Individual Sequences over Countable Alphabet (S. Kuzuoka and T. Uyematsu), Proc. of 2004 ISITA, pp.1416-1421 (October, 2004).
  • Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder (T. Fukatani, R. Matsumoto, and T. Uyematsu), Proc. of 2004 ISITA, pp.1507-1510 (October, 2004).
  • Performance of Multistage Universal Decoder for Given Linear Codes over Additive Noise Channels (T. Uyematsu and F. Kanaya), Proc. of 2004 ISITA, pp.1585-1591 (October, 2004).
Posted by 植松友彦 at 4:39 午後
Categories: 発表論文