The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Noboru Hamada: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sumiyasu Yamamoto, Hideto Ikeda, Shinsei Shige-eda, Kazuhiko Ushio, Noboru Hamada
    Design of a New Balanced File Organization Scheme With the Least Redundancy [Citation Graph (2, 0)][DBLP]
    Information and Control, 1975, v:28, n:2, pp:156-175 [Journal]
  2. Noboru Hamada
    The Nonexistence of Ternary [231, 6, 153] Codes. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:50, n:, pp:- [Journal]
  3. Noboru Hamada
    The Nonexistence of Quaternary Linear Codes With Parameters [243, 5, 181], [248, 5, 185] and [240, 5, 179]. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:51, n:, pp:- [Journal]
  4. Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
    A New Class of Nonbinary Codes Meeting the Griesmer Bound. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:3, pp:219-226 [Journal]
  5. Marijn van Eupen, Noboru Hamada, Yoko Watamori
    The Nonexistence of Ternary [50, 5, 32] Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:7, n:3, pp:235-237 [Journal]
  6. Noboru Hamada
    A Necessary and Sufficient Condition for the Existence of Some Ternary [n, k, d] Codes Meeting the Greismer Bound. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:10, n:1, pp:41-56 [Journal]
  7. Noboru Hamada, Marijn van Eupen
    The Nonexistence of Ternary [38, 6, 23] Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:13, n:2, pp:165-172 [Journal]
  8. Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
    On the Construction of [q4 + q2 - q, 5, q4 - q3 + q2 - 2q; q]-Codes Meeting the Griesmer Bound. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1992, v:2, n:3, pp:225-229 [Journal]
  9. Noboru Hamada
    On a Geometrical Method of Construction of Maximal t-Linearly Independent Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:25, n:1, pp:14-28 [Journal]
  10. Noboru Hamada
    The Geometric Structure and the p-Rank of an Affine Triple System Derived from a Nonassociative Moufang Loop with the Maximum Associative Center. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1981, v:30, n:3, pp:285-297 [Journal]
  11. Noboru Hamada, Yasuyuki Kobayashi
    On the Block Structure of BIB Designs with Parameters v = 22, b = 33, r = 12, k = 8, and lambda = 4. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:24, n:1, pp:75-83 [Journal]
  12. Noboru Hamada, Tor Helleseth, Halvard Martinsen, Øyvind Ytrehus
    There is no ternary [28, 6, 16] code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1550-1554 [Journal]
  13. Noboru Hamada, Michel Deza
    Characterization of {2(q+1)+2, 2;t, q}- min·hypers in PG(t, q) (t>=3, q>=5) and its applications to error-correcting codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:71, n:3, pp:219-231 [Journal]
  14. Noboru Hamada, Michel Deza
    A survey of recent works with respect to a characterization of an (n, k, d; q)-code meeting the Griesmer bound using a min·hyper in a finite projective geometry. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:77, n:1-3, pp:75-87 [Journal]
  15. Noboru Hamada, Michel Deza
    A characterization of {2valpha+1 + 2vbeta+1, 2valpha + 2vbeta; t, q}- minihypers in PG(t, q) (t >= 2, q >= 5 and 0 >= alpha < beta < t) and its applications to error-correcting codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:93, n:1, pp:19-33 [Journal]
  16. Noboru Hamada, Tor Helleseth
    A characterization of some {2ualpha+1+ugamma+1, 2ualpha+ugamma; k-1, 3}- minihypers and some (n, k, 3k-1 -2·3alpha-3gamma; 3)-codes (k>=3, 0<=alpha<gamma<k-1) me [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:104, n:1, pp:67-81 [Journal]
  17. Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
    Characterization of {2(q+1)+2, 2;t, q}-minihypers in PG(t, q) (t>=3, qepsilon{3, 4}). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:115, n:1-3, pp:175-185 [Journal]
  18. Noboru Hamada
    A characterization of some [n, k, d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:116, n:1-3, pp:229-268 [Journal]
  19. Noboru Hamada, Tor Helleseth
    A characterization of some {3vµ+1, 3vµ; k-1, q}-minihypers and some [n, k, qk-1 - 3qµ; q]-codes (k >= 3, q >= 5, 1 <= µ < k-1) meeting the Griesmer bound. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:146, n:1-3, pp:59-67 [Journal]

Search in 0.174secs, Finished in 0.174secs
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