Comments, with reply, on 'On the coveting radius of codes' by R.L. Graham and N.J.A. Sloane. - Mahesh C. Bhandari; M. S. Garg (IEEE Trans. Inf. Theory, 1990)

A note on the covering radius of optimum codes. - Mahesh C. Bhandari; M. S. Garg (Discret. Appl. Math., 1991)

Optimum codes of dimension 3 and 4 over GF(4). - Mahesh C. Bhandari; M. S. Garg (IEEE Trans. Inf. Theory, 1992)

A New Lower Bound on the Minimal Length of a Binary Linear Code. - Mahesh C. Bhandari; M. S. Garg (Eur. J. Comb., 1996)

A note on bounds for q-ary covering codes. - Mahesh C. Bhandari; C. Durairajan 001 (IEEE Trans. Inf. Theory, 1996)

On Lower Bounds For Covering Codes. - Mahesh C. Bhandari; K. K. P. Chanduka; Arbind K. Lal (Des. Codes Cryptogr., 1998)

On Z4-Simplex Codes and Their Gray Images. - Mahesh C. Bhandari; Manish K. Gupta 004; Arbind K. Lal (AAECC, 1999)

Lower Bounds for Group Covering Designs. - K. K. P. Chanduka; Mahesh C. Bhandari; Arbind K. Lal (AAECC, 1999)

Some Results on NQR Codes. - Mahesh C. Bhandari; Manish K. Gupta 004; Arbind K. Lal (Des. Codes Cryptogr., 1999)

A Note On Covering Radius Of Macdonald Codes. - Mahesh C. Bhandari; C. Durairajan 001 (ITCC, 2003)

On Linear Codes over Z2s. - Manish K. Gupta 004; Mahesh C. Bhandari; Arbind K. Lal (Des. Codes Cryptogr., 2005)