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

James A. Wiseman

dblp:31/2226 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1992
0000-0001-9880-1612ORCID · corroborated

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

Theory of computation · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
3 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › q-ary codes
binary codes
0.031992
New Binary Codes from a Generalization of Zinoviev's Technique · Inf. Comput. 1992
New binary codes constructed by an old technique · IEEE Trans. Inf. Theory 1983
A Construction of Nonlinear Codes Which Betters or Equals Known Results for Certain Parameters · Inf. Control. 1981
Coding theory › error-correcting codes
code construction
0.021992
New Binary Codes from a Generalization of Zinoviev's Technique · Inf. Comput. 1992
A Construction of Nonlinear Codes Which Betters or Equals Known Results for Certain Parameters · Inf. Control. 1981
Coding theory
error-correcting codes
0.011983
New binary codes constructed by an old technique · IEEE Trans. Inf. Theory 1983
Coding theory › error-correcting codes
nonlinear codes
0.011981
A Construction of Nonlinear Codes Which Betters or Equals Known Results for Certain Parameters · Inf. Control. 1981
Coding theory › error-correcting codes
concatenated codes
0.011983
New binary codes constructed by an old technique · IEEE Trans. Inf. Theory 1983

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

zinoviev's technique · 0.0generalization · 0.0combinatorial construction · 0.0
YearPublicationVenuePosition
1992 New Binary Codes from a Generalization of Zinoviev's Technique
James A. Wiseman
Inf. Comput.1
1988 A Sylvester Theorem for Conic Sections
James A. Wiseman
Discret. Comput. Geom.1
1983 New binary codes constructed by an old technique
abstract
Applying a known concatenation procedure to a[30, 15, 12]quadratic residue code over GF(4) results in29new binary codes. Each of these codes is larger than previous codes having the same length and minimum distance.
James A. Wiseman
IEEE Trans. Inf. Theory1
1981 A Construction of Nonlinear Codes Which Betters or Equals Known Results for Certain Parameters
James A. Wiseman
Inf. Control.1