Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Domenick Calabro

dblp:48/931 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1968
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 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
2 papers
Coding theory · 71% Algorithms and data structures · 29%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › sequences › sequence design
sequence synthesis		 0.011968
Synthesis of cyclically orthogonal binary sequences of the same least period · IEEE Trans. Inf. Theory 1968
Algorithms and data structures
two-dimensional arrays		 0.011967
On the Synthesis of Two-Dimensional Arrays with Desirable Correlation Properties · Inf. Control. 1967
Coding theory › error-correcting codes › coding bounds
code size bounds		 0.011968
Synthesis of cyclically orthogonal binary sequences of the same least period · IEEE Trans. Inf. Theory 1968

Methods — techniques the papers use, named apart from their topics

group algebra · 0.0
YearPublicationVenuePosition
1968 Synthesis of cyclically orthogonal binary sequences of the same least period
abstract
The generation of cyclically orthogonal binary codes of the same least period is discussed. It will be shown that pairs of cyclically orthogonal binary sequences of length and least periodN = 2^{k}rcan be synthesized for all integerskand any nonprime odd integer r. The structure of these codes is self-evident from the synthesis; hence, codes of any given length of the indicated form are readily obtained. Bounds on the maximum possible number of mutually cyclically orthogonal binary sequences of the same least period are also presented.
Domenick Calabro, Joseph Paolillo
 IEEE Trans. Inf. Theory1
1967 On the Synthesis of Two-Dimensional Arrays with Desirable Correlation Properties
Domenick Calabro, Jack K. Wolf
 Inf. Control.1