Generalized partially balanced incomplete block designs. - Kishore Sinha (Discret. Math., 1987)

On the 2-adjugate mod 2 class of designs. - Kishore Sinha (J. Comb. Theory A, 1988)

Constructions of partially balanced bipartite block designs. - Sanpei Kageyama; Kishore Sinha (Discret. Math., 1991)

A class of q-ary codes. - Kishore Sinha (Discret. Math., 1994)

Two Series of BIB Designs. - Roger Logan; Mithilesh Kumar Singh; Kishore Sinha (Ars Comb., 1998)

A Series of quasi-multiple BIB Designs from Hadamard Matrices. - Kishore Sinha; Byron Jones; Sanpei Kageyama (Ars Comb., 1998)

A construction of Hadamard matrices from BIBD (2k2-2k+1, k, 1). - Mithilesh Kumar Singh; Kishore Sinha; Sanpei Kageyama (Australas. J Comb., 2002)

Some series of block designs with nested rows and columns. - Kishore Sinha; Sanpei Kageyama; Ashish Das; G. M. Saha (Australas. J Comb., 2004)

A-efficient balanced treatment incomplete block designs. - Ashish Das; Aloke Dey; Sanpei Kageyama; Kishore Sinha (Australas. J Comb., 2005)

New Digital Fingerprint Code Construction Scheme Using Group-Divisible Design. - In Koo Kang; Kishore Sinha; Heung-Kyu Lee (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

A Class of Optimal Quaternary Codes. - Kishore Sinha; Neelam Sinha (Ars Comb., 2010)

Some matrix constructions of L2-type Latin square designs. - Shyam Saurabh; Kishore Sinha (Bull. ICA, 2022)

Perfect secret sharing schemes from combinatorial squares. - Shyam Saurabh; Kishore Sinha (Secur. Priv., 2022)

Matrix approaches to constructions of group divisible designs. - Shyam Saurabh; Kishore Sinha (Bull. ICA, 2023)

LDPC Codes Based on α-Resolvable Designs. - Shyam Saurabh; Kishore Sinha (SN Comput. Sci., 2023)

Optimal key pre-distribution schemes from affine resolvable and partially affine resolvable designs. - Shyam Saurabh; Kishore Sinha (Secur. Priv., 2024)

Near regular LDPC codes based on combinatorial designs. - Shyam Saurabh; Sheet Nihal Topno; Kishore Sinha (Discret. Math. Algorithms Appl., 2025)