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

Patrick Perry

dblp:16/5148 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1998
—ORCID · none

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

Theory of computation · 3 · 2 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
2 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes
0.011998
Runlength Limited Codes for Single Error-Detection and Single Error-Correction with Mixed Type Errors · IEEE Trans. Inf. Theory 1998
Coding theory › constrained coding
runlength-limited codes
0.011998
Runlength Limited Codes for Single Error-Detection and Single Error-Correction with Mixed Type Errors · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes
single error correction
0.011998
Runlength Limited Codes for Single Error-Detection and Single Error-Correction with Mixed Type Errors · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes
error detection
0.011991
Necessary conditions for good error detection · IEEE Trans. Inf. Theory 1991
Coding theory › error-correcting codes › error detection
undetected error probability
0.011991
Necessary conditions for good error detection · IEEE Trans. Inf. Theory 1991
Coding theory
magnetic recording
0.011998
Runlength Limited Codes for Single Error-Detection and Single Error-Correction with Mixed Type Errors · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › block codes
linear code
0.011991
Necessary conditions for good error detection · IEEE Trans. Inf. Theory 1991
Coding theory › error-correcting codes
weight distribution
0.011991
Necessary conditions for good error detection · IEEE Trans. Inf. Theory 1991

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

parity block insertion · 0.0constraint satisfaction · 0.0necessary condition · 0.0binary symmetric channel analysis · 0.0
YearPublicationVenuePosition
1998 Runlength Limited Codes for Single Error-Detection and Single Error-Correction with Mixed Type Errors
abstract
Runlength limited (RLL) codes are used in magnetic recording. The error patterns that occur with peak detection magnetic recording systems when using a runlength-limited code consist of both symmetric errors and shift errors. We refer to shift errors and symmetric errors collectively as mixed type errors. A method of providing error control for mixed type errors that occur in a runlength limited code comprised of (d, k) constrained sequences is examined. The coding scheme is to choose parity blocks to insert in the constrained information sequence. The parity blocks are chosen to satisfy the constraints and to provide some error control. The cases of single error-detection and single error-correction are investigated, where the single error is allowed to be a shift error or a symmetric error. Bounds are discussed on the possible lengths for the parity blocks. It is shown that the single error-detection codes are the best possible in terms of the length of the parity blocks.
Patrick Perry, Mingche Li, Mao Chao Lin
IEEE Trans. Inf. Theory1
1993 Correction to 'A note on the Shannon capacity of runlength-limited codes' (Jul 87 601-605)
abstract
Two remarks in the above-titled paper by J. Ashley and P.H. Siegel (see ibid. vol.33, no.4, p.601-5, July 1987) pertaining to the rationality of the base b capacity of (d, k) runlength-limited (RLL) constraints and (d, k; c) charge-constrained RLL constraints, where b>2, are corrected.>
Jonathan J. Ashley, Michael Hilden, Patrick Perry, Paul H. Siegel
IEEE Trans. Inf. Theory3
1991 Necessary conditions for good error detection
abstract
The problem of determining the error detection capabilities of linear codes where the channel is a binary symmetric channel is addressed. Necessary conditions are given on the number of codewords in an (n,k) linear code and its dual for the probability of an undetected error to be upper bounded by 2/sup -(n-k)/.>
Patrick Perry
IEEE Trans. Inf. Theory1