( A ) Bibliographies

DESIGNS/CODES/CRYPTOGRAPHY
N.V.Semakov,V.A.Zinoviev(1968)Equidistant q-ary codes with maximal distance and resolvable balkanced incomplete block designs,Problemi Pertedatchi Informatsii, 4,3-10.
K.Naemura,G.Nakamura,K.Ikeno(1971):Constant -weight codes and block designs,Trans.IECE Jpn,54-A,9-10.
D.R.Stinson,G.H.J.vanRees(1984).The equival3ence of certain equidistant binary codes and symmetric BIBDs,Combinatorica,4,357-362.
V.D.Tonchev,(1988)Combinatorial cnfigurations: Designs, Codes, Graphs, Longman,Wiley,New York.
K.Sinha,( 1994 ) A class of q-ary codes,Discrete Mathematics, 126 ,439 - 440.
(with I.K.Kang,H.K.Lee)(2006),A new digital fingerprinting code using group divisible designs ,Transactions IEICE: Fundamentals, Japan vol.E39-A,no.12,3732-5.
(with R.K.Mitra ) 1999 , Nested balanced block designs,rectangular desgins and q-ary codes, 3 ,71-80.
S.Kageyama,IY.Miao(1999).Two classes of q-ary codes based on group divisible association schemes,Discrete Mathematics.195,269-276.
G.T.Bagdanova,T.Todorov,V.A.Zinoviev,(2006)on construction of q-ary equidistant codes,in:Proceedings of the ACCT,2006,Russia,pp.31-35.
Mausumi Bose, Rahul Mukerjee(2006)Optimal (2, n) visual cryptographic schemes,Designs, Codes and Cryptography ,40,3,255-267.
H.Ito,M.Kobayashi,G.Nakamura(2007),Semi-distance codes and steiner systems,Graphs and Combinatorics,23,283-290.
K.Sinha, Z.wang,D.Wu (2008) Good equidistant codes from certain combinatorial designs,Discrete Mathematics,308,4205-4211.
K.Sinha,N.Sinha(2009) A class of optimal equidistant codes, Ars Combinatoria, to appear.
BALANCED ARRAY
Chakravarti, I. M. (1956). Fractional replication in asymmetrical factorial designs and partially balanced arrays. Sankhya 17, 143-164.
Chakravarti, I. M. (1961). On some methods of construction of partially balanced arrays. Ann. Math. Statist. 32, 1181-1185.
Chakravarti, I. M. (1963). Orthogonal and partial balanced arrays and their application in design of experiments. Metrika 7, 231-243.
Chakravarty, R. and Dey, A. (1976). On the construction of balanced and orthogonal arrays. Canad. J. Statist. Ser. D 4, 109-117.
Dey, A., Kulshreshtha, A. C. and Saha, G. M. (1972). Three symbol partially balanced arrays. Ann. Inst. Statist. Math. 24, 525-528
Dey, A. and Mukerjee, R. (1999). Fractional Factorial Plans. Wiley, New York.
Fuji-hara, R.Kuriki, S., Miao, Y. and Shinohara, S. (2002). Balanced nested designs and balanced n- ary designs, J.Stat.Plann.Infer.,to appear.
Hedayat, A. S., Sloane, N. J. A. and Stufken, J. (1999). Orthogonal Arrays, Theory and Applications. Springer, New York.
Kageyama, S. and Urata, K. (2000). Bounds on orthogonal/balanced arrays. Bull. Fac. Educ. Hiroshima Univ., Part II, No. 49, 25-32.
Shirakura, T. (1993). Fractional factorial designs of two and three levels. Discrete Math. 116, 99-135.
Sinha, K. (1994). A class of balanced arrays, main-effect plans and regular group divisible designs. Sankhya B 56, 267-271
Sinha, K. and Nigam, A. K. (1983). Balanced arrays and main-effect plans from regular group divisible designs. J. Statist. Plann. Inference 8, 223-229.
Sinha, K.,Dhar,V.,Saha,G.M.,Kageyama,S.(2002)Balanced arrays of strength of two from block designs,J.Comb.Designs,10,6,303-312.
Srivastava, J. N. and Chopra, D. V. (1973). Balanced arrays and orthogonal arrays. In: A Survey of Combinatorial Theory, Chapter 35, 411-428,North-Holland, Amsterdam.
ORTHOGONAL ARRAY
Street, D. J. (1998). Orthogonal arrays as designed experiments.Bulletin of the ICA 24, 81-101.
Yamamoto, Sumiyasu (J-IINS) (with Hyodo, Yoshifumi (J-IINS); Yumiba, Hiromu (J-IINS); Takahashi, Tomonori (J-OKSC)). Enumeration and classification of two-symbol orthogonal arrays of strength t and m=t+4 constraints. J. Japan Statist. Soc. 29(1999), no. 2, 135--145.
Suen, Chung-yi (1-CVLS) (with Das, Ashish D. (6-ISIND-TS); Dey, Aloke On the construction of asymmetric orthogonal arrays. Statist. Sinica 11 (2001), no. 1, 241--260.
Mishima, Miwako (J-GIF-I) (with Jimbo, Masakazu (J-KEIOE); Shirakura, Teruhiro (J-KOBEE-HD)). On the optimality of orthogonal array in case of correlated errors. Linear models. J. Statist. Plann.Inference 88 (2000), no. 2, 319--338.
Yang (PRC-XID-AM)). A replacement scheme on the construction of orthogonal arrays. Appl. Math. J. Chinese Univ. Ser.B 17 (2002), no. 1, 93--98.
Chan, Ling-Yau (PRC-HK-MSE) (with Fang, Kai-Tai (PRC-BAP); Mukerjee, Rahul (6-IIM)). A characterization for orthogonal arrays of strength two via a regression model.Statist. Probab. Lett. 54 (2001), no. 2, 189--192.
Rains, E. M. (1-ATT3-IS) (with Sloane, N. J. A. (1-ATT3-IS); Stufken,John (1-IASU-S)). The lattice of N-run orthogonal arrays. Silver jubilee issue. J. Statist. Plann. Inference 102 (2002),no. 2, 477--500.
Dey, Aloke (6-ISIND-TS) (with Suen, Chung-Yi (1-CVLS)) Optimal fractional factorial plans for main effects and specified two-factor interactions: a projective geometric approach. Ann.Statist. 30 (2002), no. 5, 1512--1523.
Xu, Hongquan (1-UCLA-S). An algorithm for constructing orthogonal and nearly-orthogonal arrays with mixed levels and small runs. Technometrics 44 (2002), no. 4, 356--368.
Chang, Chwen-Ming. Construction of partially replicated minimal orthogonal main effect plans using a general procedure. Util. Math. 63 (2003), 183--196.
Suen, Chung-yi (1-CVLS) (with Dey, Aloke (6-ISIND)). Construction of asymmetric orthogonal arrays through finite geometries. J. Statist. Plann. Inference 115 (2003), no. 2, 623--635.
Pang, Shanqi (PRC-XID-AM) (with Liu, San Yang (PRC-XID-AM); Zhang, Yingshan (PRC-HNO)). A note on orthogonal arrays obtained by orthogonal decomposition of projection matrices. Statist. Probab. Lett. 63 (2003), no. 4, 411--416. Upto 3
Aggarwal, M. L. (6-DELHI-ST) (with Budhraja, Veena (6-DELHISV-S)). Some new asymmetric orthogonal arrays. J. Korean Statist. Soc. 32 (2003),3, 225--233.
Suen, Chung-Yi (1-CVLS). Construction of mixed orthogonal arrays by juxtaposition. Statist. Probab. Lett. 65 (2003), no. 3, 161--163.
Butler, Neil A. (4-NOTT-SM). Generalised minimum aberration Construction results for symmetrical orthogonal arrays. Biometrika 92 (2005), no. 2, 485--491.
Pang, Shan Qi (PRC-HNO). A class of orthogonal projection matrices and related orthogonal arrays.Acta Math. Appl. Sin. 28 (2005), no. 4, 668--674.
Aggarwal, M. L. (6-DELHI) (with Budhraja, Veena (6-DELHISV); Lin, Dennis K. J. (1-PAS)). A new class of orthogonal arrays and its applications.IAPQR Trans. 28 (2003), no. 1, 23--32.
Dey, Aloke (6-ISIND-TS). Projection properties of some orthogonal arrays. Statist. Probab. Lett. 75 (2005), no. 4,298--306.
Kuhfeld, Warren F. (1-SAS) (with Suen, Chung-yi (1-CVLS)). Some new orthogonal arrays {\rm OA}(4r,r^12^p,2). Statist.Probab. Lett. 75 (2005), no. 3, 169--178.
Aggarwal, M. L. (6-DELHI-ST) (with Budhraja, Veena (6-DELHISV-S)). Some new asymmetric orthogonal arrays. J. Korean Statist.Soc. 32 (2003), no. 3, 225--233.
Das, Ashish (6-ISIND-TS) (with Dey, Aloke (6-ISIND-TS); Midha, Chand K. (1-AKR-S)). Allocating factors to the columns of an orthogonal array when certain interactions are important. Statist. Probab. Lett. 76 (2006), no. 14, 1570--1577.
Sinha,K.;Vellaisamy,P.V.;Sinha,N., Kronecker sum of binary orthogonal arrays,Utilitas Mathematica,75 (2008)249-257.
Sinha,K.,Kumar,S.,Sengupta,A.(2009)Construction of ternary orthogonal arrays by Kronecker sum ,J.Statistics and applications.
Gupta,V.K.,Sinha,K.,Prasad,R.(2008)Some constructions of mixed orthogonal arrays.

GROUP DIVISIBLE DESIGNS
Bagchi, S. (2004) Construction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designs,J.Statist.Plann.Inference, 119, 401-410.
Bhagwandas and Parihar, J.S., (1980) Some new group divisible designs, J.Statist.Plan.Inference , 4,321-323.
S.Banerjee and S. Kageyama , Non-isomorphic solutions of group divisible designs with k = 3 and lambda1 = 0,J.Statist. Plann. Inference 56 (1996), 23-32 .
Bhagwandas and Parihar, J.S. (1982) Some new series of regular group divisible designs Commun.Statist.Th.Method 11,761-768
Clatworthy, W.H., Cameron, J.M. and Speckman, J.A. (1973) Tables of two-associate class partially balanced designs ,Natl.Bur.Stand.(U.S),Appl.Math.Ser.63.
Midha,C.K., Dey,A., 1995. Cyclic group divisible designs. Calcutta Statist.Assoc. Bull . 45,179-180.
S.kageyama and T.Tanaka, Some families of group divisible designs, J.Statist. Plann. Inference 5 (1981), 231-241.
Sinha,K., 1991b, Acostruction of rectangular designs. J. Comb. Math. Comb. Comput. 9, 199-200.
K.Sinha, S.Kageyama, Composite construction of group divisible designs, Annals Institute of Statistical Mathematics 41 (1989) 409 - 414.
K.Sinha, S. Kageyama,(1986)Pairwise balanced, semi-regular and regular group divisible designs,Bulletin of Informatics and Cybernetics 22,55- 57.
De, A.K. and Roy, B.K., (1990) Computer construction of some group divisible designs,Sankhya(b)52,82-92
Dey, A. (1977) Construction of regular group divisible designs, Biometrika 64,647-649
Dey, A. and Nigam, A.K., (1985) Construction of group divisible designs, J.Indian Soc.Agric.Statist.,37,163-166
Dey, A. (1986) Theory of block designs, Wiley Eastern Ltd., New Delhi
Freeman, G.H. (1976) A cyclic method of constructing regular group divisible Incomplete block designs, Biometrika 63,555-558
Ghosh, D.K. and Divecha, J. (1995) Some new semi-regular GD designs, Sankhya (B), 57,453-455
John, J.A. and Turner, G. (1977) Some new group divisible designs, J.Statist.Plann.Inferernce 1,103-107
S. Kageyama, A construction of group divisible designs, J.Statist. Plann. Inference 12 (1985), 123-125
Sinha, K. (1987) A method of construction of regular group divisible designs, Biometrika 74,443-4.
Sinha, K. (1989) A method of constructing PBIB designs, J.Indian Soc.Agric.Statist. 41,313-315.
Sinha, K. (1991) A list of new group divisible designs, J.Res.Natl.Inst. Standards & Technology, USA, 96 (1991) 613 - 615.
K.Sinha,Constructions of semi-regular group divisible designs,Sankhya 53 B (1991) 229 - 232.
K.Sinha(1994)A class of balanced arrays, main-effect plans and regular group divisible designs,Sankhya 56 B(1994) 267 -271
K.Sinha,R.K.Mitra,N.K.Mandal,S.Kageyama(2002)Constructions of resolvable group divisible designs and related designs,Annals of Combinatorics,6,173-9.
K.Sinha,R.K.Mitra,S.Kageyama,M.K.Singh (2002) Constructions of group divisible designs and nested group divisible designs,Utilitas Mathematica 61,2002,167-174.
K.Sinha,S.Kageyama (2006) Constructions of group divisible designs and related combinatorial structures,Journal of Statist.Plann.Infer.
RECTANGULAR DESIGNS
Bagchi, S., Cheng, C.S. (1993) Some optimal designs of block size two. J.Statist.Plann.Infer. 37,245-253.
Bagchi, S. (2004) Construction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designs, J.Statist.Plann.Infer., 119, 401-410.
Cheng, C.S., Constantine, G.M. (1986) On the efficiency of regular generalized line graph designs,J.Statist.Plann.Infer.,15,1-10
K. Hinkelmann and O. Kempthorne, Two classes of group divisible partial diallel crosses, Biometrika 50 (1963), 281-291.
Kageyama, S., Miao,Y.,1995. Some methods of constrution of rectangular PBIB designs. Combin. Graph Theory 1, 186-198.
S.Kageyama and T.Tanaka, Some families of group divisible designs, J.Statist. Plann. Inference 5 (1981), 231-241.
Sinha, K., Kageyama, S., Singh, M.K. (1993) Construction of rectangular designs, Statistics, 25,63-70.
Sinha,K., Mitra,R.K., Saha,G.M., 1996. Nested BIB designs, balanced bipartite block designs and rectangular designs. Utilitas Math. 49, 216-222.
Suen,C., 1989. Some rectangular designs costructed by the method of differences. J. Statist. Plann. Inference 21, 273-276.
NESTED GROUP DIVISIBLE DESIGNS
X. Duan and S. Kageyama , Construction of nested group divisible design,Statist. & Prob. Lett. 18 (1993),41-48.
1. Y.Miao, S. Kageyama and X. Duan, Further constructions of nested group divisible designs, J. Japan Statist. Soc. 26 (1996) ,231-239.
Sinha, B.K. and Shah, K.R. (1988). Optimality of aspects of 3-concurrence most balanced designs,J.Statist.Plann.Infer., 20,229-236.
Bhagwandas , Sinha,K.,S.Kageyama Constructions of PBIB designs based on nested group divisible association Scheme,Utilitas Mathematica,41 ( 1992 ) 169 - 174.
Sinha, K., Kageyama, S. (1992) Constructions of some E-optimal 3-concurrence most balanced designs, J.Statist.plann.Infer.,31,127-132.
Sinha, K. (1994) On E-optimal nested group divisible designs, Sankhya, 56B, 3,447-8.
Sinha, K. (1999) Constructions of nested group divisible designs and rectangular designs, Statist.Inference. & Design of Experiments, eds., Dixit and Satam,Narosha Publishing Co., New Delhi, 110-116.
P.M. Roy, Heirarichal group divisible incomplete block designs with m associate classes , Science and Culture 19(1953), 210-211.
D.Raghavarao, A generalization of group divisible designs, Ann. Math. Statist. 31(1960), 756-771.
DIALLEL CROSSES DESIGNS:
Dharmalingam, M. Construction of partial triallel crosses based on Trojan square design. J. Appl. Stat. 29 (2002), no.5, 695--702.
K. C. Choi, S.Gupta and Y.N.Son (2002) Partial diallel cross block Designs, Ars Combinatoria64, 51-64
K.C. Choi, S. Gupta, S.Kageyama, Designs for diallel crosses for test versus control Comparisons, Utilitas Mathematica
K.C.Choi, K.Chatterjee, A.Das, S.Gupta, (2002) Optimality of orthogonally blocked diallels with specific combining abilities, Statistics & Probability Letters 57145-150
S.Gupta, S.Kageyama (2001) More optimal designs for diallel cross experiments, Metrika 53 183-187
F.S.Chai, R.Mukherjee, (1999) Optimal designs for diallel crosses With specific combining abilities, Biometrika, 86,2,253-458
Sharma, M.K. (1998) Partial diallel crosses through circular designs,J.Ind.Soc.Ag.Statist.Vol.LI,No.1,17-27.
D.K. Ghosh, J.Divecha, (1997) Two associate class partially balanced incomplete block designs and partial diallel crosses,Biometrika 84,1,pp.245-248
A.Das, A.M.Dean, S.Gupta, (1998) On optimality of some partial diallel cross designs, Sankhya, Volume 60,Series B,Pt.3,511-524
R.Mukherjee, Optimal partial diallel crosses, Biometrika (1997), 84,4,939-948
A.Das, A.Dey, A.M.Dean, (1996) Optimal designs for diallel cross experiment, Statistics & Probability Letters 36 427-436
S.Gupta, Das, A.Kageyama, S. (1995) Single replicate orthogonal block designs for circulant Partial diallel crosses, Comm.Statist.A24, 2601-2607
S.Gupta, S.Kageyama, (1994) Optimal complete diallel crosses, Biometrika 81,2,420-4
A.Dey, C.K.Midha, (1996), Optimal block designs for diallel crosses, Biometrika 83, 2,484-489
S.L.Singla, (1983) Extended m-triangular designs and their applications as three factor mating designs, Indian Society of Agricultural Statistics, Vol.XXXV,No.2,August
K.Hinkelmann, (1964) Extended group divisible partially balanced incomplete block designs,The Annals of Mathematical Statistics,Vol.35,No.2,June
K.Hinkelmann, O.Kempthorne, (1963) Two classes of group divisible partial diallel crosses, Biometrika, Vol. 50,No.3&4,
Griffing, B. (1956) Concepts of general and specific combining ability in relation to diallel crossing systems,Aust.J.Biol.Sci,4,463-493.

Hosted by www.Geocities.ws