activity
20122024
most citedList-decoding of Subspace Codes and Rank-Metric Codes up to Singleton Bound

6 citations · 6 across the 12 of their papers we have counts for

collaborators

12 papers

cs.IT2024

Decoding Analog Subspace Codes: Algorithms for Character-Polynomial Codes

Samin Riasat, Hessam Mahdavifar

We propose efficient minimum-distance decoding and list-decoding algorithms for a certain class of analog subspace codes, referred to as character-polynomial (CP) codes, recently i…

eess.SP2024

Subspace Coding for Spatial Sensing

Hessam Mahdavifar, Robin Rajamäki, Piya Pal

A subspace code is defined as a collection of subspaces of an ambient vector space, where each information-encoding codeword is a subspace. This paper studies a class of spatial se…

cs.IT2024

Finite-Length Analysis of Polar Secrecy Codes for Wiretap Channels

Hessam Mahdavifar, Fariba Abbasi

In a classical wiretap channel setting, Alice communicates with Bob through a main communication channel, while her transmission also reaches an eavesdropper Eve through a wiretap…

cs.CR2024

DREW : Towards Robust Data Provenance by Leveraging Error-Controlled Watermarking

Mehrdad Saberi, Vinu Sankar Sadasivan, Arman Zarei +2

Identifying the origin of data is crucial for data provenance, with applications including data ownership protection, media forensics, and detecting AI-generated content. A standar…

cs.IT2024

Abelian Group Codes for Classical and Classical-Quantum Channels: One-shot and Asymptotic Rate Bounds

James Chin-Jen Pang, Sandeep Pradhan, Hessam Mahdavifar

We study the problem of transmission of information over classical and classical-quantum channels in the one-shot regime where the underlying codes are constrained to be group code…

cs.CR2024

Projective Systematic Authentication via Reed-Muller Codes

Hsuan-Po Liu, Hessam Mahdavifar

In this paper, we study the problem of constructing projective systematic authentication schemes based on binary linear codes. In systematic authentication, a tag for authenticatio…