◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Emanuele Viterbo

7 papers hereh-index 332 citations17 works total

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

author position
  • middle author4
  • last author3

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

fields
  • cs.IT4
  • cs.CR2
  • cs.DS1
same name
  • Emanuele Viterbo — 7 papers, h 6
  • Emanuele Viterbo — 3 papers, h 2
  • Emanuele Viterbo — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20222025
most citedSerial Scammers and Attack of the Clones: How Scammers Coordinate Multiple Rug Pulls on Decentralized Exchanges

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

collaborators
Showing cs.ITShow all

4 papers · 1 filter

cs.IT2025

Construction A Lattice Design Based on the Truncated Union Bound

Jiajie Xue, Brian M. Kurkoski, Emanuele Viterbo

This paper considers n=128 dimensional construction A lattice design, using binary codes with known minimum Hamming distance and codeword multiplicity, the number of minimum wei…

cs.IT2024

Block Circulant Codes with Application to Decentralized Systems

Birenjith Sasidharan, Emanuele Viterbo, Son Hoang Dau

In this paper, we design a family of [n,k,d] block circulant codes that consist of many [n0​≪n,k0​≪k,d0​] local codes and that satisfy three properties: (1) the code su…

cs.IT2024

Repairing Reed-Solomon Codes with Side Information

Thi Xinh Dinh, Ba Thong Le, Son Hoang Dau +6

We generalize the problem of recovering a lost/erased symbol in a Reed-Solomon code to the scenario in which some side information about the lost symbol is known. The side informat…

cs.IT2024

A Family of Low-Complexity Binary Codes with Constant Hamming Weights

Birenjith Sasidharan, Emanuele Viterbo, Son Hoang Dau

In this paper, we focus on the design of binary constant weight codes that admit low-complexity encoding and decoding algorithms, and that have a size M=2k. For every integer $\…

◍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.