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

Jyoti Bali

dblp:26/4995 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1998
—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%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › modulation
coded modulation
0.011998
Block-Coded PSK Modulation Using Two-Level Group Codes Over Dihedral Groups · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › coded modulation
block-coded modulation
0.011998
Block-Coded PSK Modulation Using Two-Level Group Codes Over Dihedral Groups · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › block codes
group codes
0.011998
Block-Coded PSK Modulation Using Two-Level Group Codes Over Dihedral Groups · IEEE Trans. Inf. Theory 1998

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

matched labeling · 0.0euclidean distance analysis · 0.0
YearPublicationVenuePosition
1998 Block-Coded PSK Modulation Using Two-Level Group Codes Over Dihedral Groups
abstract
A length n group code over a group G is a subgroup of G/sup n/ under component-wise group operation. Group codes over dihedral groups D/sub M/, with 2M elements, that are two-level constructible using a binary code and a code over Z/sub M/ residue class integer ring modulo M, as component codes are studied for arbitrary M. A set of necessary and sufficient conditions on the component codes for the two-level construction to result in a group code over D/sub M/ are obtained. The conditions differ for M odd and even. Using two-level group codes over D/sub M/ as label codes, the performance of a block-coded modulation scheme is discussed under all possible matched labelings of 2M-APSK and 2M-SPSK (asymmetric and symmetric PSK) signal sets in terms of the minimum squared Euclidean distance. Matched labelings that lead to automorphic Euclidean distance equivalent codes are identified. It is shown that depending upon the ratio of Hamming distances of the component codes some labelings perform better than others. The best labeling is identified under a set of restrictive conditions. Finally, conditions on the component codes for phase rotational invariance properties of the signal space codes are discussed.
Jyoti Bali, B. Sundar Rajan
IEEE Trans. Inf. Theory1