植松研究室

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

• 符号語のコストを考慮した有ひずみユニバーサル情報圧縮 (内田、植松), 電子情報通信学会論文誌(A)，J82-A，no.1, pp.104-111 (平成11年1月)．
• Channel Simulation by Interval Algorithm: A Performance Analysis of Interval Algorithm (T. Uyematsu and F. Kanaya), IEEE Trans. on Information Theory, vol.45, no.6, pp.2121-2129 (Sep. 1999).
• Universal Variable-to-Fixed Length Codes Achieving Optimum Large Deviations Performance for Empirical Compression Ratio (T. Uyematsu), IEICE Trans. Fundamentals, E82-A, no.10, pp.2246-2250 (平成11年10月).
• 非線形コンバイナ型乱数生成器の特性 ---線形複雑度，相互情報量，無相 関性について--- (白石、森井、植松、坂庭), 電子情報通信学会論文誌(A)，J83-A，no.10, pp.1169-1179 (平成12年10月)．
• Constructing Quantum Error-Correcting Codes for $p^m$-state Systems from Classical Error-Correcting Codes (R. Matsumoto and T. Uyematsu), IEICE Trans. Fundamentals, E83-A, no.10, pp.1878-1883 (平成12年10月).
• [平成14年論文賞]符号シンボルのコストを考慮したユニバーサル情報源符号化 (植松、川上), 電子情報通信学会論文誌(A) J83-A，no.11, pp.1300-1308 (平成12年11月)．
• [招待論文]Lempel-Ziv符号と情報理論(植松) , 電子情報通信学会論文誌(A) J84-A，no.6, pp.681-690 (平成13年6月).
• On the Universality of Channel Decoders Constructed from Source Encoders for Finite-State Channels (T. Uyematsu and S. M. Kisra), IEICE Trans. Fundamentals, E84-A, no.10, pp.2447-2456 (平成13年10月).
• An Algebraic Construction of Codes for Slepian-Wolf Source Networks (T. Uyematsu), IEEE Trans. Inform. Theory, vol.47, no.7, pp.3082-3088 (Nov. 2001).
• 副情報源を伴う情報源の増分分解に基づくユニバーサル符号化法の 漸近最良性 (植松、前田), 電子情報通信学会論文誌(A) J85-A, no.1, pp.95-102 (平成14年1月).
• Lower Bound for the Quantum Capacity of a Discrete Memoryless Quantum Channel (R. Matsumoto and T. Uyematsu), Journal of Mathematical Physics, vol.43, no.9, pp.4391-4403 (Sep. 2002).
• レート分割法による多重アクセス通信の誤り指数について (太田、植松), 電子情報通信学会論文誌(A)，J86-A, no.3, pp.309-312 (平成15年3月)．
• [解説]辞書法によるデータ圧縮アルゴリズム(植松), 電子情報通信学会誌, vol.86, no.3, pp.211-214 (平成15年3月).
• Two Algorithms for Random Number Generation Implemented by Using Arithmetic of Limited Precision (T. Uyematsu and Y. Li), IEICE Trans. Fundamentals, E86-A, no.10, pp.2542-2551 (Oct., 2003).
• Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information (T. Uyematsu and S. Kuzuoka), IEICE Trans. Fundamentals, E86-A, no.10, pp.2615-2617 (Oct., 2003).
• 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).
• [招待論文]情報源のコスト付き符号化とその応用(植松), 電子情報通信学会論文誌(A), J87-A, No.5, pp.588-596 (平成16年5月).
• 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).
• 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).
• 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).
• 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).
• Low Density Parity Check Matrices for Coding of Correlated Sources (J. Muramatsu, T. Uyematsu, T. Wadayama), conditionary accepted in IEEE Trans. Inform. Theory.

• 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).