Sanpei Kageyama - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2017

Existence on Splitting-Balanced Block Designs with ResolvabilityKazuki Matsubara, Masanori Sawa, Sanpei Kageyama. gc, 33(3):561-572, 2017. [doi]

Pairwise additive 1-rotational BIB designs with λ=1Kazuki Matsubara, Sanpei Kageyama. ajc, 68:202-217, 2017. [doi]

2007

Use of complementary property of block designs in PBIB designsRajender Parsad, Sanpei Kageyama, V. K. Gupta. arscom, 85, 2007.

2005

A-efficient balanced treatment incomplete block designsAshish Das, Aloke Dey, Sanpei Kageyama, Kishore Sinha. ajc, 32:243-252, 2005. [doi]

Recursive constructions on large sets of some balanced incomplete block designsMiho Kimura, Sanpei Kageyama. arscom, 75, 2005.

Constructions of 3-resolvable nested 3-designs and 3-wise balanced designsSarita Rudra, Shakti Banerjee, Sanpei Kageyama. ajc, 33:77-86, 2005. [doi]

2004

Some series of block designs with nested rows and columnsKishore Sinha, Sanpei Kageyama, Ashish Das, G. M. Saha. ajc, 29:337, 2004. [doi]

2003

Combinatorial structure of group divisible designs without alpha-resolution classes in each groupTomoko Adachi, Masakazu Jimbo, Sanpei Kageyama. DM, 265(1-3):1-11, 2003. [doi]

2002

Balanced nested designs and balanced arraysRyoh Fuji-Hara, Sanpei Kageyama, Shinya Kuriki, Ying Miao, Shigenobu Shinohara. DM, 259(1-3):91-119, 2002. [doi]

2-2k+1, k, 1)Mithilesh Kumar Singh, Kishore Sinha, Sanpei Kageyama. ajc, 26:93-98, 2002. [doi]

2001

A combinatorial structure of affine (a1, ..., at)-resolvable (r, l)-designsSanpei Kageyama, Tsutomu Shimata. arscom, 58, 2001.

1999

Two classes of q-ary codes based on group divisible association schemesYing Miao, Sanpei Kageyama. DM, 195(1-3):269-276, 1999. [doi]

1998

A Construction for Resolvable Designs and Its GeneralizationsSanpei Kageyama, Ying Miao. gc, 14(1):11-24, 1998. [doi]

Constructions of nested directed BIB designsMiwako Mishima, Ying Miao, Sanpei Kageyama, Masakazu Jimbo. ajc, 18:157-172, 1998. [doi]

A Series of quasi-multiple BIB Designs from Hadamard MatricesKishore Sinha, Byron Jones, Sanpei Kageyama. arscom, 50, 1998.

1996

22 Block designs: Their combinatorial and statistical propertiesTadeusz Calinski, Sanpei Kageyama. In Sumit Ghosh, Calyampudy Radhakrishna Rao, editors, Design and analysis of experiments. Volume 13 of Handbook of statistics, pages 809-873, North-Holland, 1996. [doi]

Some constructions of semiframesSanpei Kageyama, Ying Miao. arscom, 43, 1996.

Some Non-embeddable Quasi-Derived DesignsSanpei Kageyama, Ying Miao. JCT, 76(2):295-304, 1996. [doi]

1995

New Bound for Afine Resolvable Designs and Its Application to Authentication CodesKaoru Kurosawa, Sanpei Kageyama. cocoon 1995: 292-302

1993

Experimental design: methods and applications an updated bibliography of books in EnglishSanpei Kageyama. DM, 116(1-3):369-403, 1993. [doi]

Robustness of some balanced block designsSanpei Kageyama. DM, 116(1-3):159-181, 1993. [doi]

The family of block designs with some combinatorial propertiesSanpei Kageyama. DM, 116(1-3):17-54, 1993. [doi]

1991

Constructions of partially balanced bipartite block designsSanpei Kageyama, Kishore Sinha. DM, 92(1-3):137-144, 1991. [doi]

1986

Symmetry and classification of certain regular group divisible designsBhagwandas, Sanpei Kageyama, Rahul Mukerjee. gc, 2(1):15-20, 1986. [doi]

1983

On mu-resolvable BIB designsSanpei Kageyama, R. N. Mohan. DM, 45(1):113-121, 1983. [doi]

1978

Improved inequalities for balanced incomplete block designsSanpei Kageyama. DM, 21(2):177-188, 1978. [doi]

1977

Classifications of Certain t-DesignsSanpei Kageyama. JCT, 22(2):163-168, 1977.

1974

On the Incomplete Block Designs Derivable from the Association SchemesSanpei Kageyama. JCT, 17(2):269-272, 1974.

Sign in or sign up to see more results.

runs on WebDSL