加载中…
Motivated by applications in spatial genomics, we revisit group testing (Dorfman~1943) and propose the class of -{\sf ADD}-codes, studying such codes with certain distance and codelength . When is constant, we provide explicit code constructions with rates close to . When is proportional to , we provide a GV-type lower bound whose rates are efficiently computable. Upper bounds for such codes are also studied.

生成讲解博客的中文版本

生成AI智能校验的中文版本