The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mahesh C. Bhandari: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  11. A note on the covering radius of optimum codes. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002