Demo Data from VLDB 2026 / reviewers in the wild / expert
Bal Kishan Dass
dblp:59/1474
· DBLP profile ↗
7ranked-venue papers
5as first author
0since 2021 · last 1981
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
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
3 papers |
Coding theory · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › error detection
error-locating codes |
0.0 | 1 | 1981 | Comments on 'Error-locating codes - A new concept in error control' by J. K. Wolf and B. Elspas · IEEE Trans. Inf. Theory 1981 |
Coding theory › error-correcting codes
burst error correction |
0.0 | 2 | 1975 | A Sufficient Bound for Codes Correcting Bursts with Weight Constraint · J. ACM 1975 Extended Varshamov- Gilbert and sphere-packing bounds for burst-correcting codes (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Coding theory › error-correcting codes
coding bounds |
0.0 | 1 | 1974 | Extended Varshamov- Gilbert and sphere-packing bounds for burst-correcting codes (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Coding theory
error-correcting codes |
0.0 | 1 | 1974 | Extended Varshamov- Gilbert and sphere-packing bounds for burst-correcting codes (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Coding theory › error-correcting codes › coding bounds › minimum distance bounds
gilbert-varshamov bound |
0.0 | 1 | 1974 | Extended Varshamov- Gilbert and sphere-packing bounds for burst-correcting codes (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Coding theory › error-correcting codes › coding bounds › packing bounds
sphere-packing bound |
0.0 | 1 | 1974 | Extended Varshamov- Gilbert and sphere-packing bounds for burst-correcting codes (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Methods — techniques the papers use, named apart from their topics
parity-check bound · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1981 | Comments on 'Error-locating codes - A new concept in error control' by J. K. Wolf and B. Elspas
Bal Kishan Dass, Sunil Kumar Muttoo |
IEEE Trans. Inf. Theory | 1 |
| 1980 | A note on Reed-Muller codes
Bal Kishan Dass, Sunil Kumar Muttoo |
Discret. Appl. Math. | 1 |
| 1980 | A bound for random and closed loop burst error detecting codes
Bal Kishan Dass, Sunil Kumar Muttoo |
Inf. Sci. | 1 |
| 1980 | Bounds on blockwise burst error correcting linear codes
Bal Kishan Dass, Vinod Tyagi |
Inf. Sci. | 1 |
| 1975 | A Sufficient Bound for Codes Correcting Bursts with Weight ConstraintabstractAn upper bound on the sufficient number of panty-cheek positions of a hnear code capable of correcting bursts of a given length or less having a weight constraint over them is presented An example of a code which corrects all bursts of length 3 or less that have weight 2 or less is given. Bal Kishan Dass |
J. ACM | 1 |
| 1975 | Correction to 'Extended Varshamov-Gilbert and Sphere-Packing bounds for Burst-Correcting Codes'
Bhu Dev Sharma, Bal Kishan Dass |
IEEE Trans. Inf. Theory | 2 |
| 1974 | Extended Varshamov- Gilbert and sphere-packing bounds for burst-correcting codes (Corresp.)abstractThe study of burst-error-correcting codes has generally been made without weight considerations while the random-error-correcting capabilities of a linear code largely depend upon the minimum weight. In this correspondence we have obtained extensions of the Varshamov-Gilbert and sphere-packing hounds to burst-error-correcting codes. Bhu Dev Sharma, Bal Kishan Dass |
IEEE Trans. Inf. Theory | 2 |