Demo Data from EDBT 2026 / reviewers in the wild / expert
Arunkant M. Patel
dblp:178/4966
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1972
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1
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
1 paper |
Coding theory · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › burst error correction
byte error-correcting codes |
0.0 | 1 | 1972 | A General Class of Maximal Codes ror Computer Applications · IEEE Trans. Computers 1972 |
Coding theory
error-correcting codes |
0.0 | 1 | 1972 | A General Class of Maximal Codes ror Computer Applications · IEEE Trans. Computers 1972 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1972 | A General Class of Maximal Codes ror Computer ApplicationsabstractThe error-correcting codes for symbols from GF (2b) are often used for correction of byte-errors in binary data. In these byte-error-correcting codes each check symbol in GF (2b) is expressed as b binary check digits and each information symbol in GF (2b), likewise, is expressed by b binary information digits. A new class of codes for single-byte-error correction is presented. The code is general in that the code structure does not depend on symbols from GF (2b). In particular, the number of check bits are not restricted to the multiples of b as in the case of the codes derived from GF (2b) codes. The new codes are either perfect or maximal and are easily implementable using shift registers. Se June Hong, Arunkant M. Patel |
IEEE Trans. Computers | 2 |