Noboru Hamada

Publication Activity (10 Years)

Years Active: 1975-2000
Publications (10 Years): 0

Publications

Noboru Hamada, Tor Helleseth, Halvard Martinsen, Øyvind Ytrehus
There is no ternary [28, 6, 16] code. IEEE Trans. Inf. Theory 46 (4) (2000)
Noboru Hamada
The Nonexistence of Quaternary Linear Codes With Parameters [243, 5, 181], [248, 5, 185] and [240, 5, 179]. Ars Comb. 51 (1999)
Noboru Hamada, Marijn van Eupen
The Nonexistence of Ternary [38, 6, 23] Codes. Des. Codes Cryptogr. 13 (2) (1998)
Noboru Hamada
The Nonexistence of Ternary [231, 6, 153] Codes. Ars Comb. 50 (1998)
Noboru Hamada
A Necessary and Sufficient Condition for the Existence of Some Ternary [n, k, d] Codes Meeting the Greismer Bound. Des. Codes Cryptogr. 10 (1) (1997)
Marijn van Eupen, Noboru Hamada, Yoko Watamori
The Nonexistence of Ternary [50, 5, 32] Codes. Des. Codes Cryptogr. 7 (3) (1996)
Noboru Hamada, Tor Helleseth
; q]-codes (k >= 3, q >= 5, 1 <= µ < k-1) meeting the Griesmer bound. Discret. Math. 146 (1-3) (1995)
Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
A New Class of Nonbinary Codes Meeting the Griesmer Bound. Discret. Appl. Math. 47 (3) (1993)
Noboru Hamada
A characterization of some [n, k, d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry. Discret. Math. 116 (1-3) (1993)
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}). Discret. Math. 115 (1-3) (1993)
Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
- 2q; q]-Codes Meeting the Griesmer Bound. Des. Codes Cryptogr. 2 (3) (1992)
Noboru Hamada, Tor Helleseth
; 3)-codes (k>=3, 0<=alpha<gamma<k-1) meeting the Griesmer bound. Discret. Math. 104 (1) (1992)
Noboru Hamada, Michel Deza
; t, q}- minihypers in PG(t, q) (t >= 2, q >= 5 and 0 >= alpha < beta < t) and its applications to error-correcting codes. Discret. Math. 93 (1) (1991)
Noboru Hamada, Tor Helleseth
A Characterization of Some Minihypers in a Finite Projective Geometry PG(t, 4). Eur. J. Comb. 11 (6) (1990)
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. Discret. Math. 77 (1-3) (1989)
Noboru Hamada
}-min · hypers and its applications to error-correcting codes. Graphs Comb. 5 (1) (1989)
Noboru Hamada
}-min · hypers in a Finite projective geometry. Graphs Comb. 5 (1) (1989)
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. Discret. Math. 71 (3) (1988)
Noboru Hamada, Fumikazu Tamari
Construction of Optimal Linear Codes Using Flats and Spreads in a Finite Projective Geometry. Eur. J. Comb. 3 (2) (1982)
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. J. Comb. Theory, Ser. A 30 (3) (1981)
Noboru Hamada
On a Geometrical Method of Construction of Maximal t-Linearly Independent Sets. J. Comb. Theory, Ser. A 25 (1) (1978)
Noboru Hamada, Yasuyuki Kobayashi
On the Block Structure of BIB Designs with Parameters v = 22, b = 33, r = 12, k = 8, and lambda = 4. J. Comb. Theory, Ser. A 24 (1) (1978)
Sumiyasu Yamamoto, Hideto Ikeda, Shinsei Shige-eda, Kazuhiko Ushio, Noboru Hamada
Design of a New Balanced File Organization Scheme With the Least Redundancy Inf. Control. 28 (2) (1975)