2024/05/11 by Chen, Kok Hao, Dao, Duc Tu, Kiah, Han Mao +2
#FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.2405.06870
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 d and codelength n. When d is constant, we provide explicit code constructions with rates close to 1/2. When d is proportional to n, we provide a GV-type lower bound whose rates are efficiently computable. Upper bounds for such codes are also studied.