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

Arthur Kohlenberg

dblp:134/3712 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1968
—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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
burst error channel
0.011968
Convolutional coding for channels with memory · IEEE Trans. Inf. Theory 1968
Coding theory › error-correcting codes
convolutional codes
0.011968
Convolutional coding for channels with memory · IEEE Trans. Inf. Theory 1968
Coding theory › error-correcting codes › decoding › decoding algorithms
threshold decoding
0.011968
Convolutional coding for channels with memory · IEEE Trans. Inf. Theory 1968
Coding theory › error-correcting codes › LDPC codes
gallager codes
0.011968
Convolutional coding for channels with memory · IEEE Trans. Inf. Theory 1968

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

threshold decoding · 0.0error propagation analysis · 0.0
YearPublicationVenuePosition
1968 Convolutional coding for channels with memory
abstract
This paper discusses the use of two types of convolutional codes, diffuse threshold-decoded codes and Gallager codes, on channels with memory (burst channels). The operation of these codes is explained and test results are given for a variety of equipments operated over phone line, HF radio, and troposcatter channels. Error propagation in the threshold-decoded codes is discussed and, in the Appendix, we prove that, for one important diffuse code, propagation is finite and small.
Arthur Kohlenberg, G. David Forney Jr.
IEEE Trans. Inf. Theory1