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

John A. Ryan

dblp:04/2339 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2015
—ORCID · none

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

Theory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic coding theory		 0.212015
Counting Extended Irreducible Binary Quartic Goppa Codes of Length 2n+1 · IEEE Trans. Inf. Theory 2015
Coding theory › error-correcting codes › combinatorial coding theory
code enumeration		 0.212015
Counting Extended Irreducible Binary Quartic Goppa Codes of Length 2n+1 · IEEE Trans. Inf. Theory 2015
Coding theory › error-correcting codes › algebraic geometry code
goppa codes		 0.212015
Counting Extended Irreducible Binary Quartic Goppa Codes of Length 2n+1 · IEEE Trans. Inf. Theory 2015

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

finite field theory · 0.2
YearPublicationVenuePosition
2015 Counting Extended Irreducible Binary Quartic Goppa Codes of Length 2n+1
abstract
We produce an upper bound on the number of extended irreducible binary quartic Goppa codes of length 2n+1, where n > 3 is a prime number.
John A. Ryan
 IEEE Trans. Inf. Theory1
2006 Enumeration of inequivalent irreducible Goppa codes
John A. Ryan, Patrick Fitzpatrick
 Discret. Appl. Math.1
2004 Quasicyclic irreducible Goppa codes
abstract
We establish the existence and give constructions of two new classes of quasicyclic irreducible Goppa codes. We give simple numerical conditions on the degree of the Goppa polynomial and length of an irreducible Goppa code which are sufficient conditions for it to be a member of one of these classes.
John A. Ryan, Patrick Fitzpatrick
 ISIT1