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

Sliraga I. Bross

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › modulation
coded modulation
0.011995
Unit-memory codes for continuous phase modulation in an AWGN channel · IEEE Trans. Commun. 1995
Physical-layer communications › modulation
continuous phase modulation
0.011995
Unit-memory codes for continuous phase modulation in an AWGN channel · IEEE Trans. Commun. 1995
Coding theory › error-correcting codes
convolutional codes
0.011995
Unit-memory codes for continuous phase modulation in an AWGN channel · IEEE Trans. Commun. 1995
Coding theory › error-correcting codes › convolutional codes
unit memory codes
0.011995
Unit-memory codes for continuous phase modulation in an AWGN channel · IEEE Trans. Commun. 1995
Physical-layer communications › channel modeling › gaussian channel
AWGN channel
0.011995
Unit-memory codes for continuous phase modulation in an AWGN channel · IEEE Trans. Commun. 1995

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

free distance lower bound · 0.0exhaustive search · 0.0
YearPublicationVenuePosition
1995 Unit-memory codes for continuous phase modulation in an AWGN channel
abstract
The combination of unit-memory codes and continuous phase modulation in an additive white Gaussian noise channel is considered. Our motivation is based on the fact that when Rouanne and Costello's (1988) free distance lower bound is applied to unit-memory codes an improved lower bound is obtained. Specific constructions are considered for 4-level modulation schemes with full response and weak partial response-heuristic design rules are used for defining the subsets of codes within which an exhaustive search is conducted. The coding gains of the best codes within these subsets are better than those of best previously known multi-memory codes.>
Sliraga I. Bross
IEEE Trans. Commun.1