EDBT 2026 Demo / reviewers in the wild / expert
M. S. Garg
dblp:40/4068
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Coding theory · 87% Information theory · 13% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › coding bounds
code length bounds |
0.0 | 1 | 1992 | Optimum codes of dimension 3 and 4 over GF(4) · IEEE Trans. Inf. Theory 1992 |
Coding theory › error-correcting codes › block codes › linear code
code parameters |
0.0 | 1 | 1992 | Optimum codes of dimension 3 and 4 over GF(4) · IEEE Trans. Inf. Theory 1992 |
Coding theory
error-correcting codes |
0.0 | 1 | 1992 | Optimum codes of dimension 3 and 4 over GF(4) · IEEE Trans. Inf. Theory 1992 |
Coding theory › error-correcting codes
optimal codes |
0.0 | 1 | 1992 | Optimum codes of dimension 3 and 4 over GF(4) · IEEE Trans. Inf. Theory 1992 |
Coding theory › error-correcting codes
q-ary codes |
0.0 | 1 | 1992 | Optimum codes of dimension 3 and 4 over GF(4) · IEEE Trans. Inf. Theory 1992 |
Methods — techniques the papers use, named apart from their topics
combinatorial bounds · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | Optimum codes of dimension 3 and 4 over GF(4)abstractn/sub q/(k,d), the length of a q-ary optimum code for given k and d, for q=4 and k=3, 4 is discussed. The problem is completely solved for k=3, and the exact value of n/sub 4/(4,d) is determined for all but 52 values of d.> Mahesh C. Bhandari, M. S. Garg |
IEEE Trans. Inf. Theory | 2 |
| 1991 | A note on the covering radius of optimum codes
Mahesh C. Bhandari, M. S. Garg |
Discret. Appl. Math. | 2 |
| 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 | 2 |