5 citations · 7 across the 7 of their papers we have counts for
7 papers
Construction A Lattice Design Based on the Truncated Union Bound
Jiajie Xue, Brian M. Kurkoski, Emanuele Viterbo
This paper considers dimensional construction A lattice design, using binary codes with known minimum Hamming distance and codeword multiplicity, the number of minimum wei…
Serial Scammers and Attack of the Clones: How Scammers Coordinate Multiple Rug Pulls on Decentralized Exchanges
Phuong Duy Huynh, Son Hoang Dau, Nicholas Huppert +5
We explored the ubiquitous phenomenon of serial scammers, each of whom deployed dozens to thousands of addresses to conduct a series of similar Rug Pulls on popular decentralized e…
Block Circulant Codes with Application to Decentralized Systems
Birenjith Sasidharan, Emanuele Viterbo, Son Hoang Dau
In this paper, we design a family of block circulant codes that consist of many local codes and that satisfy three properties: (1) the code su…
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…
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 . For every integer $\…
From Programming Bugs to Multimillion-Dollar Scams: An Analysis of Trapdoor Tokens on Uniswap
Phuong Duy Huynh, Thisal De Silva, Son Hoang Dau +3
We investigate in this work a recently emerged type of scam ERC-20 token called Trapdoor, which has cost investors billions of US dollars on Uniswap, the largest decentralised exch…
TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead
Son Hoang Dau, Quang Cao, Rinaldo Gagiano +9
A Batch Private Information Retrieval (batch-PIR) scheme allows a client to retrieve multiple data items from a database without revealing them to the storage server(s). Most exist…