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

Alan W. Pierce

dblp:300/8028 · DBLP profile ↗
← Back
1ranked-venue papers
0as 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

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%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › cyclic codes
BCH codes
0.011968
Performance of selected block and convolutional codes on a fading HF channel · IEEE Trans. Inf. Theory 1968
Coding theory › error-correcting codes
block codes
0.011968
Performance of selected block and convolutional codes on a fading HF channel · IEEE Trans. Inf. Theory 1968
Coding theory › error-correcting codes
concatenated codes
0.011968
Performance of selected block and convolutional codes on a fading HF channel · IEEE Trans. Inf. Theory 1968
Coding theory › error-correcting codes
convolutional codes
0.011968
Performance of selected block and convolutional codes on a fading HF channel · IEEE Trans. Inf. Theory 1968
Coding theory
error-correcting codes
0.011968
Performance of selected block and convolutional codes on a fading HF channel · IEEE Trans. Inf. Theory 1968
Physical-layer communications
fading channels
0.011968
Performance of selected block and convolutional codes on a fading HF channel · IEEE Trans. Inf. Theory 1968
Physical-layer communications › fading channels
HF channel
0.011968
Performance of selected block and convolutional codes on a fading HF channel · IEEE Trans. Inf. Theory 1968

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

threshold decoding · 0.0interleaving · 0.0computer simulation · 0.0
YearPublicationVenuePosition
1968 Performance of selected block and convolutional codes on a fading HF channel
abstract
This paper describes the application of selected block and convolutional coding techniques to digital transmission over an HF radio channel. Performance results are presented for interleaved binary Bose-Chaudhuri-Hocquenghem (BCH) codes, interleaved two-stage concatenated codes, and diffuse convolutional codes. The performance results are based upon raw error data recorded in transmission over a 640-km HF path, with various data runs representing the typical effects of frequency-selective and non-selective fading, atmospheric impulse noise, and interference from other users of the HF band. The performance of binary BCH codes with bit interleaving is presented and the selection of a code to meet a specified performance criterion is described. The sensitivity of specific codes to changing channel conditions is presented, along with the cost, in terms of interleaving, of designing for one set of channel conditions rather than others. Concatenated codes are discussed as a means of effective error control on channels with clustered errors. Performance data are presented for selected two-stage codes used with inner-stage word interleaving and the effects of varying certain of the code parameters are shown. Emphasis is placed on code designs that use the inner-stage code only for error detection and the outer-stage code mainly for erasure filling with only a small amount of symbol error correction. The impact of error clustering on the performance of concatenated codes is discussed. Two diffuse convolutional codes are evaluated with the use of recorded error data in computer simulations of their threshold-decoding algorithms. Performance of various configurations of these convolutional codes is given and a comparison is made with that of a simple block coding scheme having the same decoder storage requirements. The various coding techniques studied are compared on the basis of achievable performance as well as certain factors affecting the feasibility of implementation.
David L. Cohn, Allen H. Levesque, John H. Meyn, Alan W. Pierce
IEEE Trans. Inf. Theory4