The SCEAS System
Navigation Menu

Search the dblp DataBase


Ryutaroh Matsumoto: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ryutaroh Matsumoto, Shinji Miura
    Computing a Basis of L(D) on an Affine Algebraic Curve with One Rational Place at Infinity. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:271-281 [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. Ryutaroh Matsumoto
    Computing the Radical of an Ideal in Positive Characteristic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2001, v:32, n:3, pp:263-271 [Journal]
  6. Ryutaroh Matsumoto, Shinji Miura
    Finding a Basis of a Linear System with Pairwise Distinct Discrete Valuations on an Algebraic Curve. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2000, v:30, n:3, pp:309-323 [Journal]
  7. Ryutaroh Matsumoto
    Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:7, pp:2122-2124 [Journal]
  8. Ryutaroh Matsumoto
    Construction algorithm for network error-correcting codes attaining the Singleton bound [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  9. Generalized Sudan's List Decoding for Order Domain Codes. [Citation Graph (, )][DBLP]

  10. Rate-Compatible Slepian-Wolf Coding with Short Non-Binary LDPC Codes. [Citation Graph (, )][DBLP]

  11. On Field Size and Success Probability in Network Coding. [Citation Graph (, )][DBLP]

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

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

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

  15. On Field Size and Success Probability in Network Coding [Citation Graph (, )][DBLP]

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

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

  18. Problems in application of LDPC codes to information reconciliation in quantum key distribution protocols [Citation Graph (, )][DBLP]

  19. Construction of wiretap codes from ordinary channel codes [Citation Graph (, )][DBLP]

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

  21. A construction of universal secure network coding [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002