We address the challenge of optimizing the capacity-achieving input distribution for a multinomial channel under the constraint of limited input support size, which is a crucial aspect in the design of DNA storage systems. We propose an algorithm that further elaborates the Multidimensional Dynamic Assignment Blahut-Arimoto (M-DAB) algorithm. Our proposed algorithm integrates variational autoencoder for determining the optimal locations of input distribution, into the alternating optimization of the input distribution locations and weights.
Cite
@article{arxiv.2501.15172,
title = {DeepDIVE: Optimizing Input-Constrained Distributions for Composite DNA Storage via Multinomial Channel},
author = {Adir Kobovich and Eitan Yaakobi and Nir Weinberger},
journal= {arXiv preprint arXiv:2501.15172},
year = {2025}
}