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

Larry C. Wilkins

dblp:135/0585 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1975
—ORCID · none

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

Computer networks · 1 · 1 first-authorTheory 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
2 papers
Coding theory · 100%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
source coding
0.021975
On the Effect of Timing Errors in Run Length Codes · IEEE Trans. Commun. 1975
Bibliography on data compression, picture properties, and picture coding · IEEE Trans. Inf. Theory 1971
Coding theory › source coding › lossless compression
run-length coding
0.011975
On the Effect of Timing Errors in Run Length Codes · IEEE Trans. Commun. 1975
Coding theory
channel coding
0.011975
On the Effect of Timing Errors in Run Length Codes · IEEE Trans. Commun. 1975
Image and video processing
image enhancement
0.011971
Bibliography on data compression, picture properties, and picture coding · IEEE Trans. Inf. Theory 1971

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

markov chain modeling · 0.0channel transition matrix · 0.0
YearPublicationVenuePosition
1975 On the Effect of Timing Errors in Run Length Codes
abstract
Many redundancy removal algorithms employ some sort of run length code. Blocks of timing words are coded with synchronization words inserted between blocks. The probability of incorrectly reconstructing a sample because of a channel error in the timing data is a monotonically nondecreasing function of time since the last synchronization word. In this paper we compute the "probability that the accumulated magnitude of timing errors equal zero" as a function of time since the last synchronization word for a zero-order predictor (ZOP). The result is valid for any data source that can be modeled by a first-order Markov chain and any digital channel that can be modeled by a channel transition matrix. An example is presented.
Larry C. Wilkins, Paul A. Wintz
IEEE Trans. Commun.1
1971 Bibliography on data compression, picture properties, and picture coding
abstract
Published papers and reports dealing with data compression, picture properties and models, picture coding and transmission, image enhancement, and human visual information processing are listed.
Larry C. Wilkins, Paul A. Wintz
IEEE Trans. Inf. Theory1