1 citations · 1 across the 5 of their papers we have counts for
6 papers
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…
Capacity-achieving Polar-based Codes with Sparsity Constraints on the Generator Matrices
James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan
In this paper, we leverage polar codes and the well-established channel polarization to design capacity-achieving codes with a certain constraint on the weights of all the columns…
New Bounds on the Size of Binary Codes with Large Minimum Distance
James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan
Let denote the maximum size of a binary code of length and minimum Hamming distance . Studying , including efforts to determine it as well to derive bound…
Capacity-achieving Polar-based LDGM Codes
James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan
In this paper, we study codes with sparse generator matrices. More specifically, low-density generator matrix (LDGM) codes with a certain constraint on the weight of the columns in…
Capacity-achieving Polar-based LDGM Codes with Crowdsourcing Applications
James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan
In this paper we study codes with sparse generator matrices. More specifically, codes with a certain constraint on the weight of all the columns in the generator matrix are conside…
Coding for Crowdsourced Classification with XOR Queries
James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan
This paper models the crowdsourced labeling/classification problem as a sparsely encoded source coding problem, where each query answer, regarded as a code bit, is the XOR of a sma…