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.
EDBT 2026 Demo / reviewers in the wild / expert

Billy D. Pettijohn

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

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

Computer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
arithmetic codes		 0.012001
Joint source/channel coding using arithmetic codes · IEEE Trans. Commun. 2001
Coding theory
joint source-channel coding		 0.012001
Joint source/channel coding using arithmetic codes · IEEE Trans. Commun. 2001
Coding theory › error-correcting codes
error detection and correction		 0.012001
Joint source/channel coding using arithmetic codes · IEEE Trans. Commun. 2001
Coding theory › error-correcting codes › decoding
sequential decoding		 0.012001
Joint source/channel coding using arithmetic codes · IEEE Trans. Commun. 2001

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

sequential decoding · 0.0
YearPublicationVenuePosition
2001 Joint source/channel coding using arithmetic codes
abstract
Reserving space fur a symbol that is not in the source alphabet has been shown to provide excellent error detection. In this paper, we show how to exploit this capability using two sequential decoder structures to provide powerful error correction capability. This joint source/channel coder design provides significant packet loss recovery with minimal rate overhead, and compares favorably with conventional schemes.
Billy D. Pettijohn, Michael W. Hoffman, Khalid Sayood
 IEEE Trans. Commun.1
2000 Joint Source/Channel Coding Using Arithmetic Codes
abstract
Reserving space for a symbol that is not in the source alphabet has been shown to provide excellent error detection. In this paper we show how to use this capability using a sequential decoder structure to provide powerful error correction capability. This joint source/channel coder design provides significant packet loss recovery with minimal overhead.
Billy D. Pettijohn, Khalid Sayood, Michael W. Hoffman
 Data Compression Conference1