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.

Richard G. C. Williams

dblp:06/5115 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2000
—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%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › coded modulation
block-coded modulation
0.012000
Rate gains in block-coded modulation systems with interblock memory · IEEE Trans. Inf. Theory 2000
Coding theory
channel coding
0.012000
Rate gains in block-coded modulation systems with interblock memory · IEEE Trans. Inf. Theory 2000
Coding theory › error-correcting codes
coded modulation
0.012000
Rate gains in block-coded modulation systems with interblock memory · IEEE Trans. Inf. Theory 2000
Coding theory
coding gain
0.012000
Rate gains in block-coded modulation systems with interblock memory · IEEE Trans. Inf. Theory 2000
Coding theory › error-correcting codes › coded modulation › block-coded modulation
interblock memory
0.012000
Rate gains in block-coded modulation systems with interblock memory · IEEE Trans. Inf. Theory 2000

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

normalized distance design · 0.0
YearPublicationVenuePosition
2000 Rate gains in block-coded modulation systems with interblock memory
abstract
This paper examines the performance gains achievable by adding interblock memory to, and altering the mapping of coded bits to symbols in, block-coded modulation systems. The channel noise considered is additive Gaussian, and the twin design goals are to maximize the asymptotic coding gain and to minimize the number of apparent nearest neighbors. In the case of the additive white Gaussian noise channel, these goals translate into the design of block codes of a given weighted or 'normalized' distance whose rate is as high as possible, and whose number of codewords at minimum normalized distance is low. The effect of designing codes for normalized distance rather than Hamming distance is to ease the problem of determining the best codes for given parameters in the cases of greatest interest, and many such best codes are given.
Chia-Ning Peng, Houshou Chen, John T. Coffey, Richard G. C. Williams
IEEE Trans. Inf. Theory4