EDBT 2026 Demo / reviewers in the wild / expert
Chandra Satyanarayana
dblp:134/5241
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1979
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Human-computer interaction and ubiquitous computing · 1 · 1 first-authorTheory 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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
cyclic codes |
0.0 | 1 | 1979 | Lee metric codes over integer residue rings (Corresp.) · IEEE Trans. Inf. Theory 1979 |
Coding theory › error-correcting codes
lee codes |
0.0 | 1 | 1979 | Lee metric codes over integer residue rings (Corresp.) · IEEE Trans. Inf. Theory 1979 |
Coding theory › error-correcting codes › algebraic coding theory
reversible code |
0.0 | 1 | 1979 | Lee metric codes over integer residue rings (Corresp.) · IEEE Trans. Inf. Theory 1979 |
Coding theory › error-correcting codes
reed-muller codes |
0.0 | 1 | 1979 | Lee metric codes over integer residue rings (Corresp.) · IEEE Trans. Inf. Theory 1979 |
Methods — techniques the papers use, named apart from their topics
module theory · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1979 | Lee metric codes over integer residue rings (Corresp.)abstractA method for constructing Lee metric codes over arbitrary alphabet sizes using the elementary concepts of module theory is presented. The codes possess a high degree of symmetry. Codes with two information symbols over arbitrary alphabet sizes are cyclic reversible. For alphabet sizes which are a power of two or an odd prime number, codes with one information symbol are reversible and equidistant, and codes having more than two information symbols are quasi-cyclic reversible. Binary Reed-Muller codes arise as subcodes of the codes presented. A method of constructing equidistant Lee metric codes analogous to maximum length shift register codes is presented. Chandra Satyanarayana |
IEEE Trans. Inf. Theory | 1 |
| 1978 | Review of "Applied Graph Theory: Graphs and Electrical Networks" by W. K. Chen
Chandra Satyanarayana |
IEEE Trans. Syst. Man Cybern. | 1 |