EDBT 2026 Demo / reviewers in the wild / expert
Auro Artom
dblp:272/8013
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1972
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 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
1 paper |
Coding theory · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › constrained coding › line codes
DC-free codes |
0.0 | 1 | 1972 | Choice of Prefix in Self-Synchronizing Codes · IEEE Trans. Commun. 1972 |
Coding theory › constrained coding
line codes |
0.0 | 1 | 1972 | Choice of Prefix in Self-Synchronizing Codes · IEEE Trans. Commun. 1972 |
Coding theory › source coding › variable-length codes
prefix codes |
0.0 | 1 | 1972 | Choice of Prefix in Self-Synchronizing Codes · IEEE Trans. Commun. 1972 |
Coding theory › constrained coding › synchronization codes
self-synchronizing codes |
0.0 | 1 | 1972 | Choice of Prefix in Self-Synchronizing Codes · IEEE Trans. Commun. 1972 |
Coding theory › constrained coding
synchronization |
0.0 | 1 | 1972 | Choice of Prefix in Self-Synchronizing Codes · IEEE Trans. Commun. 1972 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1972 | Choice of Prefix in Self-Synchronizing CodesabstractIn this correspondence a special prefix code with stuffing bits is described and the sequences that are more suitable as prefixes, called valid sequences, are determined by means of a condition they must satisfy. The best prefix length as a function of the total number of bits in the code is then evaluated. Auro Artom |
IEEE Trans. Commun. | 1 |