植松研究室

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