◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Sandeep Pradhan

2 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author1

Across the 1 of 2 papers where every author was matched, so the position is known.

fields
  • cs.IT2
ORCID 0000-0001-8406-4404

identity via Semantic Scholar / OpenAlex

most citedHow to Compute Modulo Prime-Power Sums

5 citations · 5 across the 2 of their papers we have counts for

collaborators
Showing cs.ITShow all

2 papers · 1 filter

cs.IT2017

How to Compute Modulo Prime-Power Sums ?

Mohsen Heidari, Farhad Shirani, Sandeep Pradhan

A new class of structured codes called Quasi Group Codes (QGC) is introduced. A QGC is a subset of a group code. In contrast with group codes, QGCs are not closed under group addit…

cs.IT2016★ 5 cited

How to Compute Modulo Prime-Power Sums

Mohsen Heidari, S. Sandeep Pradhan

The problem of computing modulo prime-power sums is investigated in distributed source coding as well as computation over Multiple-Access Channel (MAC). We build upon group codes a…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.