Demo Data from VLDB 2026 / reviewers in the wild / expert
Lorenzo Calabi
dblp:39/6310
· DBLP profile ↗
6ranked-venue papers
6as first author
0since 2021 · last 1969
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5 · 5 first-authorSystems, architecture and hardware · 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
6 papers |
Coding theory · 90% Computational complexity · 6% Combinatorics and discrete mathematics · 2% |
Topics — the 7 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
insertion-deletion codes |
0.0 | 2 | 1969 | A family of codes for the correction of substitution and synchronization errors · IEEE Trans. Inf. Theory 1969 Some General Results of Coding Theory with Applications to the Study of Codes for the Correction of Synchronization Errors · Inf. Control. 1969 |
Coding theory
error-correcting codes |
0.0 | 3 | 1969 | A family of codes for the correction of substitution and synchronization errors · IEEE Trans. Inf. Theory 1969 On the minimal weight of binary group codes (Corresp.) · IEEE Trans. Inf. Theory 1964 A class of binary systematic codes correcting errors at random and in bursts · IRE Trans. Inf. Theory 1959 |
Coding theory › error-correcting codes › block codes
group codes |
0.0 | 1 | 1964 | On the minimal weight of binary group codes (Corresp.) · IEEE Trans. Inf. Theory 1964 |
Coding theory › error-correcting codes
block codes |
0.0 | 1 | 1969 | A family of codes for the correction of substitution and synchronization errors · IEEE Trans. Inf. Theory 1969 |
Coding theory › error-correcting codes
burst error correction |
0.0 | 1 | 1959 | A class of binary systematic codes correcting errors at random and in bursts · IRE Trans. Inf. Theory 1959 |
Coding theory › error-correcting codes › block codes › linear code
systematic codes |
0.0 | 1 | 1959 | A class of binary systematic codes correcting errors at random and in bursts · IRE Trans. Inf. Theory 1959 |
Information theory › communication channels › channel models › discrete memoryless channel
erasure channel |
0.0 | 1 | 1959 | A class of binary systematic codes correcting errors at random and in bursts · IRE Trans. Inf. Theory 1959 |
Methods — techniques the papers use, named apart from their topics
inessentiality analysis · 0.0decoding scheme design · 0.0block code construction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1969 | Some General Results of Coding Theory with Applications to the Study of Codes for the Correction of Synchronization Errors
Lorenzo Calabi, W. E. Hartnett |
Inf. Control. | 1 |
| 1969 | A family of codes for the correction of substitution and synchronization errorsabstractBinary block codes are constructed that are capable of correcting, in everyt \geq 3consecutive words, either one substitution error in each one of, at the most,t-2words, or one synchronization error (but not both). In order to decode any one word, the decoder needs to wait for the reception of, at the most, the nextt-1words. Lorenzo Calabi, W. E. Hartnett |
IEEE Trans. Inf. Theory | 1 |
| 1964 | On the minimal weight of binary group codes (Corresp.)
Lorenzo Calabi, Eric R. Myrvaagnes |
IEEE Trans. Inf. Theory | 1 |
| 1962 | Inessentiality in Minimal Networks and Formulas
Lorenzo Calabi, J. A. Riley |
IRE Trans. Electron. Comput. | 1 |
| 1961 | A Note on Rank and Nullity in Coding Theory
Lorenzo Calabi |
Inf. Control. | 1 |
| 1959 | A class of binary systematic codes correcting errors at random and in burstsabstractPresentation of results concerning the performance of a family of binary systematic codes of arbitrary size, correcting bursts of considerable length and/or "random" errors. The basic idea of these codes is due to C. Hobbs of the Air Force Cambridge Research Center. For the codes of two sub-families, practical decoding schemes are given. Also formulated are results concerning the use of these codes with erasure channels. Lorenzo Calabi, H. G. Haefeli |
IRE Trans. Inf. Theory | 1 |