Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Hamada, Noboru"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A new class of nonbinary codes meeting the Griesmer bound
Noboru Hamada
,
Tor Helleseth
,
Øyvind Ytrehus
Discrete Applied Mathematics
47
, 1993, pp. 219-226
Characterization of
{2 (q+1) + 2,2; t,q}
-minihypers in PG
(t,q)(t \ge 3, q \epsilon {3,4})
Noboru Hamada
,
Tor Helleseth
,
Øyvind Ytrehus
Discrete Mathematics
115
(1-3), 1993, pp. 175-185
A characterization of some
[n, k, d; q]
-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
Noboru Hamada
Discrete Mathematics
116
(1-3), 1993, pp. 229-268
Characterization of
\{(q+1)+2,1;t,q\}-min \cdot hypers
and
\{2(q+1)+2,2;2,q\}-min\cdot hypers
in a finite projective geometry
Noboru Hamada
Graphs and Combinatorics
5
, 1989, pp. 63-81
Characterization of
\{v_{\mu+1}+2v_\mu,v_\mu+2v_{\mu-1};t,q\}-min\cdot hypers
and its applications to error-correcting codes
Noboru Hamada
Graphs and Combinatorics
5
, 1989, pp. 137-147
On the block structure of BIB designs with parameters
v=22,b=33,r=12,k=8
, and
\lambda=4
Noboru Hamada
,
Yasuyuki Kobayashi
Journal of Combinatorial Theory Series A
24
, 1978, pp. 75-83
On a geometrical method of construction of maximal
t
-linearly independent sets
Noboru Hamada
,
Fumikazu Tamari
Journal of Combinatorial Theory Series A
25
, 1978, pp. 14-28
Design of a new balanced file organization scheme with the least redundancy
Sumiyasu Yamamoto
,
Hideto Ikeda
,
Shinsei Shige-Eda
,
Kazuhiko Ushio
,
Noboru Hamada
Information and Control
28
, 1975, pp. 156-175