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

Harriett B. Rigas

dblp:34/4590 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1991
—ORCID · none

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

Theory of computation · 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 · 75% Algorithms and data structures · 25%

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

TopicWeightPapersLastEvidence papers
Coding theory › sequences › sequence design
correlation properties
0.011991
2-D quasi m -arrays and Gold code arrays · IEEE Trans. Inf. Theory 1991
Coding theory › sequences › sequence design › correlation properties
periodic correlation
0.011991
2-D quasi m -arrays and Gold code arrays · IEEE Trans. Inf. Theory 1991
Algorithms and data structures
two-dimensional arrays
0.011991
2-D quasi m -arrays and Gold code arrays · IEEE Trans. Inf. Theory 1991

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

modulo-2 addition · 0.0maximal length sequences · 0.0
YearPublicationVenuePosition
1991 2-D quasi m -arrays and Gold code arrays
abstract
Two-dimensional quasi-maximal-area arrays (quasi-m-arrays) are proposed. These quasi-m-arrays are so named because their cyclic correlation properties are very close to those of the m-arrays. These arrays are generated by modulo-2 addition of maximal length sequences. The cyclic autocorrelation of any quasi-m-array is close to the delta-function. In addition, the cyclic cross-correlation is small compared with the cyclic autocorrelation peak. Two-dimensional Gold code arrays generated by the same construction method are also studied. Correlation properties of these Gold code arrays are similar to those of the quasi-m-arrays. The Gold code arrays provide families of arrays in which any two arrays have the bound on their cyclic cross-correlation. These arrays are also shown to have the quasi-orthogonal property.>
Chung J. Kuo, Harriett B. Rigas
IEEE Trans. Inf. Theory2