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

J. E. Ludman

dblp:271/5480 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1981
—ORCID · none

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

Computer networks · 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.

Computer networks
1 paper
Physical-layer communications · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
modulation
0.011981
Gray Code Generation for MPSK Signals · IEEE Trans. Commun. 1981
Physical-layer communications › modulation › phase-shift keying
MPSK
0.011981
Gray Code Generation for MPSK Signals · IEEE Trans. Commun. 1981
Physical-layer communications › modulation
phase-shift keying
0.011981
Gray Code Generation for MPSK Signals · IEEE Trans. Commun. 1981
Coding theory
channel coding
0.011981
Gray Code Generation for MPSK Signals · IEEE Trans. Commun. 1981
Coding theory › error-correcting codes › combinatorial coding theory
gray codes
0.011981
Gray Code Generation for MPSK Signals · IEEE Trans. Commun. 1981
Physical-layer communications › error probability analysis
bit error rate analysis
0.011981
Gray Code Generation for MPSK Signals · IEEE Trans. Commun. 1981

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

code generation · 0.0
YearPublicationVenuePosition
1981 Gray Code Generation for MPSK Signals
abstract
Presented here are techniques for generating desired gray codes with properties different from those of the standard binary reflected gray code. For communications using phase shift-keyed (PSK) signals with different significances for different phases, it is desirable to have such codes with different bit error probabilities. For some applications, it is important to have codes with arbitrary crossover Hamming distances. These techniques are suitable for generating codes with either or both of these properties. The codes generated may be far longer than those generated by current computer search techniques.
J. E. Ludman
IEEE Trans. Commun.1