Conference paper
(1 + ε)-approximate sparse recovery
Eric Price, David P. Woodruff
FOCS 2011
Paper
The Uniqueness of the Best Code
Abstract
We prove that the (10,40,4) code found by Best is unique. We then employ this fact to show that A(10,3) =A(11,4) < 78 and A(11,3) =A(12,4) < 156. Optimal codes, bounds on the size of a code, constant- weight codes. © 1994 IEEE
Related
Lixi Zhou, Jiaqing Chen, et al.
VLDB
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Conference paper
A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005