Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.06870 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916242099535872 |
|---|---|
| author | Chen, Kok Hao Dao, Duc Tu Kiah, Han Mao Pham, Van Long Phuoc Yaakobi, Eitan |
| author_facet | Chen, Kok Hao Dao, Duc Tu Kiah, Han Mao Pham, Van Long Phuoc Yaakobi, Eitan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_06870 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Noise-Tolerant Codebooks for Semi-Quantitative Group Testing: Application to Spatial Genomics Chen, Kok Hao Dao, Duc Tu Kiah, Han Mao Pham, Van Long Phuoc Yaakobi, Eitan Information Theory 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. |
| title | Noise-Tolerant Codebooks for Semi-Quantitative Group Testing: Application to Spatial Genomics |
| topic | Information Theory |
| url | https://arxiv.org/abs/2405.06870 |