Mahesh C. Bhandari

11 papers Journal 8Unranked 3
YearRankTypeTitle / Venue / Authors
2005 J jnl
On Linear Codes over Z
Des. Codes Cryptogr.
Manish K. Gupta, Mahesh C. Bhandari, Arbind K. Lal
2003 — conf
A Note On Covering Radius Of Macdonald Codes.
ITCC
Mahesh C. Bhandari, C. Durairajan
1999 — conf
Lower Bounds for Group Covering Designs.
AAECC
K. K. P. Chanduka, Mahesh C. Bhandari, Arbind K. Lal
1999 — conf
On Z
AAECC
Mahesh C. Bhandari, Manish K. Gupta, Arbind K. Lal
1999 J jnl
Some Results on NQR Codes.
Des. Codes Cryptogr.
Mahesh C. Bhandari, Manish K. Gupta, Arbind K. Lal
1998 J jnl
On Lower Bounds For Covering Codes.
Des. Codes Cryptogr.
Mahesh C. Bhandari, K. K. P. Chanduka, Arbind K. Lal
1996 J jnl
A New Lower Bound on the Minimal Length of a Binary Linear Code.
Eur. J. Comb.
Mahesh C. Bhandari, M. S. Garg
1996 J jnl
A note on bounds for q-ary covering codes.
IEEE Trans. Inf. Theory
Mahesh C. Bhandari, C. Durairajan
1992 J jnl
Optimum codes of dimension 3 and 4 over GF(4).
IEEE Trans. Inf. Theory
Mahesh C. Bhandari, M. S. Garg
1991 J jnl
A note on the covering radius of optimum codes.
Discret. Appl. Math.
Mahesh C. Bhandari, M. S. Garg
1990 J jnl
Comments, with reply, on 'On the coveting radius of codes' by R.L. Graham and N.J.A. Sloane.
IEEE Trans. Inf. Theory
Mahesh C. Bhandari, M. S. Garg