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

Amit K. Sharma

dblp:88/3397 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2014
0000-0002-2372-9182ORCID · reported

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

Security and privacy · 1Theory of computation · 1

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › burst error correction
byte error control codes
0.112012
MacWilliams Type Identities for Some New m-Spotty Weight Enumerators · IEEE Trans. Inf. Theory 2012
Coding theory
error-correcting codes
0.112012
MacWilliams Type Identities for Some New m-Spotty Weight Enumerators · IEEE Trans. Inf. Theory 2012
Coding theory › error-correcting codes › weight distribution
macwilliams identity
0.112012
MacWilliams Type Identities for Some New m-Spotty Weight Enumerators · IEEE Trans. Inf. Theory 2012
Coding theory › error-correcting codes
weight distribution
0.112012
MacWilliams Type Identities for Some New m-Spotty Weight Enumerators · IEEE Trans. Inf. Theory 2012
YearPublicationVenuePosition
2014 On some new m-spotty Lee weight enumerators
Anuradha Sharma, Amit K. Sharma
Des. Codes Cryptogr.2
2012 MacWilliams Type Identities for Some New m-Spotty Weight Enumerators
abstract
Past few years have seen an extensive use of high-density RAM chips with wide I/O data (e.g., 16, 32, 64 bits) in computer memory systems. These chips are highly vulnerable to a special type of byte error, called an$m$-spotty byte error, which can be effectively detected or corrected using byte error-control codes. In this paper, we present joint$m$-spotty weight enumerator and split$m$-spotty weight enumerator for byte error-control codes over the ring of integers modulo$\ell$($\ell\geq 2$is an integer) and over arbitrary finite fields. We also derive MacWilliams type identities for each of the aforementioned enumerators and discuss some of their applications.
Anuradha Sharma, Amit K. Sharma
IEEE Trans. Inf. Theory2