Mahesh C. Bhandari

Publication Activity (10 Years)

Years Active: 1990-2005
Publications (10 Years): 0

Publications

Manish K. Gupta, Mahesh C. Bhandari, Arbind K. Lal
. Des. Codes Cryptogr. 36 (3) (2005)
Mahesh C. Bhandari, C. Durairajan
A Note On Covering Radius Of Macdonald Codes. ITCC (2003)
K. K. P. Chanduka, Mahesh C. Bhandari, Arbind K. Lal
Lower Bounds for Group Covering Designs. AAECC (1999)
Mahesh C. Bhandari, Manish K. Gupta, Arbind K. Lal
Some Results on NQR Codes. Des. Codes Cryptogr. 16 (1) (1999)
Mahesh C. Bhandari, Manish K. Gupta, Arbind K. Lal
-Simplex Codes and Their Gray Images. AAECC (1999)
Mahesh C. Bhandari, K. K. P. Chanduka, Arbind K. Lal
On Lower Bounds For Covering Codes. Des. Codes Cryptogr. 15 (3) (1998)
Mahesh C. Bhandari, M. S. Garg
A New Lower Bound on the Minimal Length of a Binary Linear Code. Eur. J. Comb. 17 (4) (1996)
Mahesh C. Bhandari, C. Durairajan
A note on bounds for q-ary covering codes. IEEE Trans. Inf. Theory 42 (5) (1996)
Mahesh C. Bhandari, M. S. Garg
Optimum codes of dimension 3 and 4 over GF(4). IEEE Trans. Inf. Theory 38 (5) (1992)
Mahesh C. Bhandari, M. S. Garg
A note on the covering radius of optimum codes. Discret. Appl. Math. 33 (1-3) (1991)
Mahesh C. Bhandari, M. S. Garg
Comments, with reply, on 'On the coveting radius of codes' by R.L. Graham and N.J.A. Sloane. IEEE Trans. Inf. Theory 36 (4) (1990)