Bounds on Size of Homopolymer Free Codes
Information Theory
2023-05-19 v1 math.IT
Abstract
For any given alphabet of size , a Homopolymer Free code (HF code) refers to an code of length , size and minimum Hamming distance , where all the codewords are homopolymer free sequences. For any given alphabet, this work provides upper and lower bounds on the maximum size of any HF code using Sphere Packing bound and Gilbert-Varshamov bound. Further, upper and lower bounds on the maximum size of HF codes for various HF code families are calculated. Also, as a specific case, upper and lower bounds are obtained on the maximum size of homopolymer free DNA codes.
Keywords
Cite
@article{arxiv.2305.10741,
title = {Bounds on Size of Homopolymer Free Codes},
author = {Krishna Gopal Benerjee and Adrish Banerjee},
journal= {arXiv preprint arXiv:2305.10741},
year = {2023}
}
Comments
The work is accepted in IEEE International Symposium on Information Theory (ISIT) 2023