Demo Data from EDBT 2026 / reviewers in the wild / expert
Tamiya Nomura
dblp:134/8731
· 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
Theory of computation · 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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › sequences
linear recurring array |
0.0 | 1 | 1972 | A theory of two-dimensional linear recurring arrays · IEEE Trans. Inf. Theory 1972 |
Coding theory › sequences › pseudorandom sequences
m-sequences |
0.0 | 1 | 1972 | A theory of two-dimensional linear recurring arrays · IEEE Trans. Inf. Theory 1972 |
Coding theory › sequences
pseudorandom sequences |
0.0 | 1 | 1972 | A theory of two-dimensional linear recurring arrays · IEEE Trans. Inf. Theory 1972 |
Coding theory › error-correcting codes › cyclic codes
two-dimensional cyclic code |
0.0 | 1 | 1972 | A theory of two-dimensional linear recurring arrays · IEEE Trans. Inf. Theory 1972 |
Methods — techniques the papers use, named apart from their topics
finite field theory · 0.0autocorrelation analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1972 | A theory of two-dimensional linear recurring arraysabstractIn this paper, two-dimensional arrays of elements of an arbitrary finite field are examined, especially arrays having maximum-area matrices. We first define two-dimensional linear recurring arrays. In order to study the characteristics of two-dimensional linear recurring arrays, we also define two-dimensional linear cyclic codes. A systematic method of constructing two-dimensional linear recurring arrays having maximum-area matrices is given using the theory of two-dimensional cyclic codes. These arrays, here called\gamma \beta-arrays, may be said to be two-dimensional analogs ofM-sequences. A\gamma \beta-array of areaN_x \times N_yexists overGF(q)if and only ifN_x N_yis equal toq^N _ 1for some positive integerN. Many interesting characteristics of the\gamma \beta-array, such as the properties of its autocorrelation function and the properties of the characteristic arrays, are deduced and explained. Tamiya Nomura, Hiroshi Miyakawa, Hideki Imai, Akira Fukuda |
IEEE Trans. Inf. Theory | 1 |