2022/05/07 by Yi Liu, Liu, Yi, Yonglong Li +5
Biochemistry, Genetics and Molecular Biology · Computer Science · #DNA and Biological Computing #Cellular Automata and Applications #Algorithms and Data Compression
paper · pdf · doi:10.48550/arxiv.2205.03731
Shaping codes are used to generate code sequences in which the symbols obey a prescribed probability distribution. They arise naturally in the context of source coding for noiseless channels with unequal symbol costs. Recently, shaping codes have been proposed to extend the lifetime of flash memory and reduce DNA synthesis time. In this paper, we study a general class of shaping codes for noiseless finite-state channels with cost and i.i.d. sources. We establish a relationship between the code rate and minimum average symbol cost. We then determine the rate that minimizes the average cost per source symbol (total cost). An equivalence is established between codes minimizing average symbol cost and codes minimizing total cost, and a separation theorem is proved, showing that optimal shaping can be achieved by a concatenation of optimal compression and optimal shaping for a uniform i.i.d. source.