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 SIGIR 2026 / reviewers in the wild / expert

Joe Fields

dblp:80/4576 · also J. E. Fields · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2001
0009-0003-3677-2563ORCID · reported

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

Theory of computation · 3 · 3 first-authorSecurity and privacy · 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
2 papers
Coding theory · 90% Algorithms and data structures · 10%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes
linear code		 0.021999
On the non Z4-linearity of certain good binary codes · IEEE Trans. Inf. Theory 1999
All Self-Dual Z4 Codes of Length 15 or Less Are Known · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › block codes › linear code
self-dual codes		 0.021999
On the non Z4-linearity of certain good binary codes · IEEE Trans. Inf. Theory 1999
All Self-Dual Z4 Codes of Length 15 or Less Are Known · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › q-ary codes
binary codes		 0.011999
On the non Z4-linearity of certain good binary codes · IEEE Trans. Inf. Theory 1999
Coding theory › error-correcting codes › block codes › linear code › self-dual codes
doubly even codes		 0.011999
On the non Z4-linearity of certain good binary codes · IEEE Trans. Inf. Theory 1999
Coding theory › error-correcting codes › optimal codes
extremal codes		 0.011999
On the non Z4-linearity of certain good binary codes · IEEE Trans. Inf. Theory 1999
Algorithms and data structures
classification		 0.011998
All Self-Dual Z4 Codes of Length 15 or Less Are Known · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › codes over rings
z4-linear code		 0.011998
All Self-Dual Z4 Codes of Length 15 or Less Are Known · IEEE Trans. Inf. Theory 1998

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

gray map · 0.0classification · 0.0
YearPublicationVenuePosition
2001 On the classification of extremal even formally self-dual codes of lengths 20 and 22
Joe Fields, Philippe Gaborit, W. Cary Huffman, Vera Pless
 Discret. Appl. Math.1
1999 On the Classification of Extremal Even Formally Self-Dual Codes
Joe Fields, Philippe Gaborit, W. Cary Huffman, Vera Pless
 Des. Codes Cryptogr.1
1999 On the non Z4-linearity of certain good binary codes
abstract
In this correspondence we prove that any extremal doubly-even self-dual linear binary code of length 48 is not Z/sub 4/-linear. We also show that the putative extremal doubly-even self-dual linear binary codes of lengths 72 and 96 with minimum weight, respectively, 16 and 20, cannot be constructed as the Gray images of linear codes over Z/sub 4/.
Joe Fields, Philippe Gaborit
 IEEE Trans. Inf. Theory1
1998 All Self-Dual Z4 Codes of Length 15 or Less Are Known
abstract
We classify the self-dual Z/sub 4/ codes of all lengths from 10 through 15, extending the previous classification through length 9.
Joe Fields, Philippe Gaborit, Jeffrey S. Leon, Vera Pless
 IEEE Trans. Inf. Theory1