default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoboru Hamada
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
[j23]Noboru Hamada, Tor Helleseth, Halvard Martinsen, Øyvind Ytrehus:
There is no ternary [28, 6, 16] code. IEEE Trans. Inf. Theory 46(4): 1550-1554 (2000)
1990 – 1999
- 1999
- [j22]Noboru Hamada:
The Nonexistence of Quaternary Linear Codes With Parameters [243, 5, 181], [248, 5, 185] and [240, 5, 179]. Ars Comb. 51 (1999) - 1998
- [j21]Noboru Hamada:
The Nonexistence of Ternary [231, 6, 153] Codes. Ars Comb. 50 (1998) - [j20]Noboru Hamada, Marijn van Eupen:
The Nonexistence of Ternary [38, 6, 23] Codes. Des. Codes Cryptogr. 13(2): 165-172 (1998) - 1997
- [j19]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): 41-56 (1997) - 1996
- [j18]Marijn van Eupen, Noboru Hamada, Yoko Watamori:
The Nonexistence of Ternary [50, 5, 32] Codes. Des. Codes Cryptogr. 7(3): 235-237 (1996) - 1995
- [j17]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. Discret. Math. 146(1-3): 59-67 (1995) - 1993
- [j16]Noboru Hamada, Tor Helleseth, Øyvind Ytrehus:
A New Class of Nonbinary Codes Meeting the Griesmer Bound. Discret. Appl. Math. 47(3): 219-226 (1993) - [j15]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): 175-185 (1993) - [j14]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): 229-268 (1993) - 1992
- [j13]Noboru Hamada, Tor Helleseth, Øyvind Ytrehus:
On the Construction of [q4 + q2 - q, 5, q4 - q3 + q2 - 2q; q]-Codes Meeting the Griesmer Bound. Des. Codes Cryptogr. 2(3): 225-229 (1992) - [j12]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) meeting the Griesmer bound. Discret. Math. 104(1): 67-81 (1992) - 1991
- [j11]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. Discret. Math. 93(1): 19-33 (1991) - 1990
- [j10]Noboru Hamada, Tor Helleseth:
A Characterization of Some Minihypers in a Finite Projective Geometry PG(t, 4). Eur. J. Comb. 11(6): 541-548 (1990)
1980 – 1989
- 1989
- [j9]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): 75-87 (1989) - [j8]Noboru Hamada:
Characterization of {(q + 1) + 2, 1;t, q}-min · hypers and {2(q + 1) + 2, 2; 2, q}-min · hypers in a Finite projective geometry. Graphs Comb. 5(1): 63-81 (1989) - [j7]Noboru Hamada:
Characterization of {vμ+1 + 2vμ, vμ + 2vμ - 1;t, q}-min · hypers and its applications to error-correcting codes. Graphs Comb. 5(1): 137-147 (1989) - 1988
- [j6]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): 219-231 (1988) - 1982
- [j5]Noboru Hamada, Fumikazu Tamari:
Construction of Optimal Linear Codes Using Flats and Spreads in a Finite Projective Geometry. Eur. J. Comb. 3(2): 129-141 (1982) - 1981
- [j4]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 A 30(3): 285-297 (1981)
1970 – 1979
- 1978
- [j3]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 A 24(1): 75-83 (1978) - [j2]Noboru Hamada:
On a Geometrical Method of Construction of Maximal t-Linearly Independent Sets. J. Comb. Theory A 25(1): 14-28 (1978) - 1975
- [j1]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): 156-175 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
