Demo Data from EDBT 2026 / reviewers in the wild / expert
T. V. Selvakumaran
dblp:17/803
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1999
—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% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › coded modulation
block-coded modulation |
0.0 | 1 | 1999 | Block-Coded Modulation Using Two-Level Group Codes Over Generalized Quaternion Groups · IEEE Trans. Inf. Theory 1999 |
Coding theory › error-correcting codes › block codes
group codes |
0.0 | 1 | 1999 | Block-Coded Modulation Using Two-Level Group Codes Over Generalized Quaternion Groups · IEEE Trans. Inf. Theory 1999 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | Block-Coded Modulation Using Two-Level Group Codes Over Generalized Quaternion GroupsabstractA length n group code over a group G is a subgroup of G/sup n/ under component-wise group operation. Two-level group codes over the class of generalized quaternion groups, Q(2/sup m/), m/spl ges/3, are constructed using a binary code and a code over Z(2/sup m-1/), the ring of integers modulo 2/sup m-1/ as component codes and a mapping f from Z/sub 2//spl times/Z(2/sup m-1/)to Q(2/sup m/). A set of necessary and sufficient conditions on the component codes is derived which will give group codes over Q(2/sup m/). Given the generator matrices of the component codes, the computational effort involved in checking the necessary and sufficient conditions is discussed. Starting from a four-dimensional signal set matched to Q(2/sup m/), it is shown that the Euclidean space codes obtained from the group codes over Q(2/sup m/) have Euclidean distance profiles which are independent of the coset representative selection involved in f. A closed-form expression for the minimum Euclidean distance of the resulting group codes over Q(2/sup m/) is obtained in terms of the Euclidean distances of the component codes. Finally, it is shown that all four-dimensional signal sets matched to Q(2/sup m/) have the same Euclidean distance profile and hence the Euclidean space codes corresponding to each signal set for a given group code over Q(2/sup m/) are automorphic Euclidean-distance equivalent. T. V. Selvakumaran, B. Sundar Rajan |
IEEE Trans. Inf. Theory | 1 |