Mahesh C. Bhandari

According to our database, Mahesh C. Bhandari authored at least 11 papers between 1990 and 2005.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2005

On Linear Codes over Z_2^s.

Manish K. Gupta, Mahesh C. Bhandari, Arbind K. Lal

Des. Codes Cryptogr., 2005

2003

A Note On Covering Radius Of Macdonald Codes.

Mahesh C. Bhandari, C. Durairajan

Proceedings of the 2003 International Symposium on Information Technology (ITCC 2003), 2003

1999

Some Results on NQR Codes.

Mahesh C. Bhandari, Manish K. Gupta, Arbind K. Lal

Des. Codes Cryptogr., 1999

Lower Bounds for Group Covering Designs.

K. K. P. Chanduka, Mahesh C. Bhandari, Arbind K. Lal

Proceedings of the Applied Algebra, 1999

On Z₄-Simplex Codes and Their Gray Images.

Mahesh C. Bhandari, Manish K. Gupta, Arbind K. Lal

Proceedings of the Applied Algebra, 1999

1998

On Lower Bounds For Covering Codes.

Mahesh C. Bhandari, K. K. P. Chanduka, Arbind K. Lal

Des. Codes Cryptogr., 1998

1996

A note on bounds for q-ary covering codes.

Mahesh C. Bhandari, C. Durairajan

IEEE Trans. Inf. Theory, 1996

A New Lower Bound on the Minimal Length of a Binary Linear Code.

Mahesh C. Bhandari, M. S. Garg

Eur. J. Comb., 1996

1992

Optimum codes of dimension 3 and 4 over GF(4).

Mahesh C. Bhandari, M. S. Garg

IEEE Trans. Inf. Theory, 1992

1991

A note on the covering radius of optimum codes.

Mahesh C. Bhandari, M. S. Garg

Discret. Appl. Math., 1991

1990

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