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

P. N. Perry

dblp:95/3088 · DBLP profile ↗
← Back
1ranked-venue papers
1as 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 · 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
error detection
0.011995
Runlength-limited codes for single error detection in the magnetic recording channel · IEEE Trans. Inf. Theory 1995
Coding theory
magnetic recording
0.011995
Runlength-limited codes for single error detection in the magnetic recording channel · IEEE Trans. Inf. Theory 1995
Coding theory › constrained coding
runlength-limited codes
0.011995
Runlength-limited codes for single error detection in the magnetic recording channel · IEEE Trans. Inf. Theory 1995

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

error-check value · 0.0arithmetic function · 0.0
YearPublicationVenuePosition
1995 Runlength-limited codes for single error detection in the magnetic recording channel
abstract
An arithmetic function that assigns the value 0, 1, or 2 to each binary sequence is introduced. The authors call this function the error-check value. Two sequences that differ by a single symmetric error or a single shift error are shown to have different error-check values. Runlength-limited codes for detecting single-errors are designed by taking a set of the constrained sequences such that each code sequence has the same error-check value. Systematic runlength-limited codes that detect single errors are constructed, based on the error-check value. It is shown that these systematic runlength-limited codes have the shortest parity length possible for a single error-detecting code.>
P. N. Perry
IEEE Trans. Inf. Theory1