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

M. M. Sweet

dblp:78/4933 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1983
—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 · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes
0.011983
A Golay puzzle · IEEE Trans. Inf. Theory 1983
Coding theory › error-correcting codes › perfect codes
golay code
0.011983
A Golay puzzle · IEEE Trans. Inf. Theory 1983
YearPublicationVenuePosition
1983 A Golay puzzle
abstract
A puzzlelike algorithm for encoding and decoding the(24,12,8)Golay code is given.
Gustav Solomon, M. M. Sweet
IEEE Trans. Inf. Theory2