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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Pramod Kumar Kewat

dblp:82/11470 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
5since 2021 · last 2026
0000-0002-2483-0960ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 3 · 3 since 2021Security and privacy · 2 · 1 since 2021Theory of computation · 1 · 1 since 2021

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 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › cyclic codes
BCH codes		 1.012026
The Minimum Distance of Three Classes of Primitive BCH Codes and Certain Classes of Cyclic Codes · IEEE Trans. Inf. Theory 2026
Coding theory › error-correcting codes
cyclic codes		 1.012026
The Minimum Distance of Three Classes of Primitive BCH Codes and Certain Classes of Cyclic Codes · IEEE Trans. Inf. Theory 2026
YearPublicationVenuePosition
2026 On the Construction of Reversible Linear Codes over the Field F2r
Sujata Bansal, Pramod Kumar Kewat
 ISIT2
2026 The Minimum Distance of Three Classes of Primitive BCH Codes and Certain Classes of Cyclic Codes
Varsha Tiwari, Pramod Kumar Kewat
 IEEE Trans. Inf. Theory2
2025 An Infinite Family of Additive Codes Over the Ring $\frac{\mathbb{F}_2[u]}{\left\langle u^4\right\rangle}$ with Lee Distance 8
Sujata Bansal, Pramod Kumar Kewat
 ISIT2
2023 CSS codes and QSCs from Whiteman's Generalized Cyclotomy of order four
abstract
In this paper, Calderbank-Shor-Steane (CSS) quantum codes and Quantum synchronizable codes (QSCs) are obtained from cyclic codes, which are constructed using Whiteman’s generalized cyclotomy of order four. These CSS and QSCs have good error-correcting capability against phase and bit errors because many of the cyclic codes used to design them are optimal or nearly optimal. Moreover, QSCs obtained in this article achieve maximum tolerance against misalignment.
Varsha Tiwari, Pramod Kumar Kewat
 ISIT2
2021 Self-dual codes over ${\mathbb {F}}_2[u]/\langle u^4 \rangle $ and Jacobi forms over a totally real subfield of ${\mathbb {Q}}(\zeta _8)$
Ankur Baranwal, Pramod Kumar Kewat
 Des. Codes Cryptogr.2
2015 On cyclic codes over the ring Zp[u] / 〈uk〉
Abhay Kumar Singh 0002, Pramod Kumar Kewat
 Des. Codes Cryptogr.2