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

C. M. Hackett

dblp:271/5165 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1981
—ORCID · none

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

Computer networks · 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
block codes
0.011981
An Efficient Algorithm for Soft-Decision Decoding of the (24, 12) Extended Golay Code · IEEE Trans. Commun. 1981
Coding theory › error-correcting codes › perfect codes
golay code
0.011981
An Efficient Algorithm for Soft-Decision Decoding of the (24, 12) Extended Golay Code · IEEE Trans. Commun. 1981
Coding theory › error-correcting codes › decoding
soft-decision decoding
0.011981
An Efficient Algorithm for Soft-Decision Decoding of the (24, 12) Extended Golay Code · IEEE Trans. Commun. 1981

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

soft-decision decoding · 0.0
YearPublicationVenuePosition
1981 An Efficient Algorithm for Soft-Decision Decoding of the (24, 12) Extended Golay Code
abstract
An efficient algorithm for soft-decision decoding of the (24, 12) extended Golay code is described. Results obtained for white Gaussian noise are presented which show that performance is only a few tenths of a decibel away from that of an ideal correlator.
C. M. Hackett
IEEE Trans. Commun.1