| 2005 |
|---|
| 11 | EE | Manish K. Gupta,
Mahesh C. Bhandari,
Arbind K. Lal:
On Linear Codes over Z2s.
Des. Codes Cryptography 36(3): 227-244 (2005) |
| 2003 |
|---|
| 10 | EE | Mahesh C. Bhandari,
C. Durairajan:
A Note On Covering Radius Of Macdonald Codes.
ITCC 2003: 221-225 |
| 1999 |
|---|
| 9 | | Mahesh C. Bhandari,
Manish K. Gupta,
Arbind K. Lal:
On Z4-Simplex Codes and Their Gray Images.
AAECC 1999: 170-180 |
| 8 | | K. K. P. Chanduka,
Mahesh C. Bhandari,
Arbind K. Lal:
Lower Bounds for Group Covering Designs.
AAECC 1999: 334-345 |
| 7 | | Mahesh C. Bhandari,
Manish K. Gupta,
Arbind K. Lal:
Some Results on NQR Codes.
Des. Codes Cryptography 16(1): 5-9 (1999) |
| 1998 |
|---|
| 6 | | Mahesh C. Bhandari,
K. K. P. Chanduka,
Arbind K. Lal:
On Lower Bounds For Covering Codes.
Des. Codes Cryptography 15(3): 237-243 (1998) |
| 1996 |
|---|
| 5 | EE | Mahesh C. Bhandari,
M. S. Garg:
A New Lower Bound on the Minimal Length of a Binary Linear Code.
Eur. J. Comb. 17(4): 335-342 (1996) |
| 4 | | Mahesh C. Bhandari,
C. Durairajan:
A note on bounds for q-ary covering codes.
IEEE Transactions on Information Theory 42(5): 1640-1642 (1996) |
| 1992 |
|---|
| 3 | | Mahesh C. Bhandari,
M. S. Garg:
Optimum codes of dimension 3 and 4 over GF(4).
IEEE Transactions on Information Theory 38(5): 1564- (1992) |
| 1991 |
|---|
| 2 | EE | Mahesh C. Bhandari,
M. S. Garg:
A note on the covering radius of optimum codes.
Discrete Applied Mathematics 33(1-3): 3-9 (1991) |
| 1990 |
|---|
| 1 | | 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 Transactions on Information Theory 36(4): 953- (1990) |
