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

Jeffrey R. Hollon

dblp:203/0715 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0001-9007-9872ORCID · reported

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

Theory of computation · 1 · 1 since 2021

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 · 50% Algorithms and data structures · 50%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures
classification
0.712023
Unimodular Perfect and Nearly Perfect Sequences: a Variation of Björck's Scheme · IEEE Trans. Inf. Theory 2023
Coding theory › sequences
sequence design
0.712023
Unimodular Perfect and Nearly Perfect Sequences: a Variation of Björck's Scheme · IEEE Trans. Inf. Theory 2023
Physical-layer communications
MIMO
0.212023
Unimodular Perfect and Nearly Perfect Sequences: a Variation of Björck's Scheme · IEEE Trans. Inf. Theory 2023
Physical-layer communications › signal design
sequence design
0.212023
Unimodular Perfect and Nearly Perfect Sequences: a Variation of Björck's Scheme · IEEE Trans. Inf. Theory 2023

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

cross merit factor · 1.3classification · 1.3
YearPublicationVenuePosition
2023 Unimodular Perfect and Nearly Perfect Sequences: a Variation of Björck's Scheme
abstract
Constant Amplitude (CA), Zero Auto Correlation (ZAC) sequences (or CAZAC sequences, aka perfect sequences) have numerous applications. We generalize the CAZAC notion to what we term as CASAC by permitting small autocorrelations (SAC). We extend Björck’s classification result of two-valued CAZAC sequences by providing a complete classification of all almost 2-valued (i.e., two-valued except for the first position which uses a third value) CASAC sequences. While Björck’s original work dealt only with primes p, we extend his ideas to any abelian group of order$v\equiv 1\pmod {4}$, as opposed to restricting just to the prime fields GF(p). Björck sequences have better ambiguity function than Zadoff-Chu sequences, making them suitable for radar and communications applications in the presence of high Doppler shifts. In fact, the discrete narrow band ambiguity function has an optimal bound in case of Björck sequences (as opposed to Gauss sequences). A one-parameter infinite family of CASAC we construct would have applications in Multiple-Input Multiple-Output (MIMO) areas. Toward MIMO applications, we introduce a performance measure we term as cross merit factor to study cross correlation behavior, generalizing the well-known notion of Golay Merit Factor (GMF).
Krishnasamy Thiru Arasu, Michael R. Clark, Jeffrey R. Hollon
IEEE Trans. Inf. Theory3