The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tomohiko Uyematsu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yukiyasu Tsunoo, Eiji Okamoto, Tomohiko Uyematsu
    Ciphertext Only Attack for One-way Function of the MAP Using One Ciphertext. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:369-382 [Conf]
  2. Takayuki Fukatani, Ryutaroh Matsumoto, Tomohiko Uyematsu
    Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  3. Kenji Tanaka 0003, Ryutaroh Matsumoto, Tomohiko Uyematsu
    Maximum Mutual Information of Space-Time Block Codes with Symbolwise Decodability [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  4. Kouya Tochikubo, Tomohiko Uyematsu, Ryutaroh Matsumoto
    Efficient Secret Sharing Schemes Based on Authorized Subsets. [Citation Graph (0, 0)][DBLP]
    IEICE Transactions, 2005, v:88, n:1, pp:322-326 [Journal]
  5. Akisato Kimura, Tomohiko Uyematsu
    Weak variable-length Slepian-Wolf coding with linked encoders for mixed sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:1, pp:183-193 [Journal]
  6. Jun Muramatsu, Tomohiko Uyematsu, Tadashi Wadayama
    Low-density parity-check matrices for coding of correlated sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:10, pp:3645-3654 [Journal]
  7. Tomohiko Uyematsu
    An algebraic construction of codes for Slepian-Wolf source networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:3082-3088 [Journal]
  8. Tomohiko Uyematsu, Fumio Kanaya
    Channel simulation by interval algorithm: A performance analysis of interval algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:2121-2129 [Journal]
  9. Tomohiko Uyematsu, Eiji Okamoto
    A construction of codes with exponential error bounds on arbitrary discrete memoryless channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:3, pp:992-996 [Journal]
  10. Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka
    Universal coding for correlated sources with complementary delivery [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  11. Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka, Shun Watanabe
    Universal source coding over generalized complementary delivery networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  12. Primal-dual distance bounds of linear codes with application to cryptography [Citation Graph (, )][DBLP]


  13. Universal Coding for Lossless and Lossy Complementary Delivery Problems [Citation Graph (, )][DBLP]


  14. Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels [Citation Graph (, )][DBLP]


  15. Multiterminal source coding with complementary delivery [Citation Graph (, )][DBLP]


  16. Secret Key Agreement by Soft-decision of Signals in Gaussian Maurer's Model [Citation Graph (, )][DBLP]


  17. On the Energy Benefit of Network Coding for Wireless Multiple Unicast [Citation Graph (, )][DBLP]


  18. Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code [Citation Graph (, )][DBLP]


  19. Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers [Citation Graph (, )][DBLP]


  20. Universal Coding of Ergodic Sources for Multiple Decoders with Side Information [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002