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

J. Little

dblp:54/1483 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1995
—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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic geometry code		 0.011995
Systematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes · IEEE Trans. Inf. Theory 1995
Coding theory › error-correcting codes › algebraic geometry code
goppa codes		 0.011995
Systematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes · IEEE Trans. Inf. Theory 1995
Algorithms and data structures › symbolic computation
gröbner basis		 0.011995
Systematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes · IEEE Trans. Inf. Theory 1995
Coding theory › error-correcting codes › decoding › decoding algorithms › coding algorithms › encoding algorithms
systematic encoding		 0.011995
Systematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes · IEEE Trans. Inf. Theory 1995

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

module theory · 0.0grobner basis theory · 0.0
YearPublicationVenuePosition
1995 Systematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes
abstract
Any linear code with a nontrivial automorphism has the structure of a module over a polynomial ring. The theory of Grobner bases for modules gives a compact description and implementation of a systematic encoder. We present examples of algebraic-geometric Goppa codes that can be encoded by these methods, including the one-point Hermitian codes.
Chris Heegard, J. Little, Keith Saints
 IEEE Trans. Inf. Theory2