Demo Data from EDBT 2026 / reviewers in the wild / expert
Francis H. Hunt
dblp:135/2700
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-authorSecurity and privacy · 1 · 1 first-authorTheory 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.
| Computer networks
1 paper |
Physical-layer communications · 100% | |
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications
code-division multiple access |
0.1 | 1 | 2010 | Exploiting Spatial Separations in CDMA Systems With Correlation Constrained Sets of Hadamard Matrices · IEEE Trans. Inf. Theory 2010 |
Physical-layer communications › spread spectrum › spreading sequences
spreading sequence design |
0.1 | 1 | 2010 | Exploiting Spatial Separations in CDMA Systems With Correlation Constrained Sets of Hadamard Matrices · IEEE Trans. Inf. Theory 2010 |
Coding theory
hadamard matrices |
0.0 | 1 | 2010 | Exploiting Spatial Separations in CDMA Systems With Correlation Constrained Sets of Hadamard Matrices · IEEE Trans. Inf. Theory 2010 |
Methods — techniques the papers use, named apart from their topics
almost bent functions · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Decoding mixed errors and erasures in permutation codes
Francis H. Hunt, Stephanie Perkins, Derek H. Smith |
Des. Codes Cryptogr. | 1 |
| 2012 | The Construction of Orthogonal Variable Spreading Factor Codes from Semi-Bent FunctionsabstractIn a recent paper spreading codes for CDMA systems were constructed based on Hadamard matrices and semi-bent functions. These codes were applicable to synchronous CDMA systems and to quasi-synchronous CDMA systems when a loosely-synchronized code is used. The codes consist of the union of rows of four Hadamard matrices. The codes can be assigned to a regular tessellation of hexagonal cells in such a way that the correlation between codewords assigned to adjacent cells is zero, while the correlation between codewords assigned to non-adjacent cells is small. The use of codewords from four Hadamard matrices allows greater codeword re-use distances than the use of codewords from a single Hadamard matrix. This has advantages for both satellite and terrestrial systems. These codes only support a single data rate. The current paper shows how orthogonal variable spreading factor codes can be created from them by a careful selection of the semi-bent functions used. Francis H. Hunt, Derek H. Smith |
IEEE Trans. Wirel. Commun. | 1 |
| 2010 | Exploiting Spatial Separations in CDMA Systems With Correlation Constrained Sets of Hadamard MatricesabstractSpreading codes for code-division multiple-access (CDMA) systems are constructed based on Hadamard matrices and almost-bent functions. These codes can be assigned to a tessellation of hexagonal cells in such a way that codewords assigned to the same cell or to adjacent cells have zero cross-correlation. The nonzero cross-correlations in the code only apply to pairs of codewords assigned to nonadjacent cells. The codes have four times as many codewords as codes constructed from a single Hadamard matrix, which leads to significantly increased codeword re-use distances in comparison with the conventional use of a single Hadamard matrix with the same number of codewords per cell. Derek H. Smith, Francis H. Hunt, Stephanie Perkins |
IEEE Trans. Inf. Theory | 2 |