Greedy Construction of DNA Codes and New Bounds

TL;DR

This paper introduces a greedy algorithm for constructing DNA codes over  with bounded GC-content and derives bounds on their maximum size, advancing the design and analysis of DNA coding schemes.

Contribution

It presents a novel greedy construction method for -based DNA codes and establishes new bounds on their maximum size given length, GC-content, and edit distance.

Findings

Constructed linear -codes with bounded GC-content using a greedy algorithm.

Derived upper and lower bounds for maximum DNA code size with given parameters.

Enhanced understanding of the limits and construction methods for DNA codes with specific constraints.

Abstract

In this paper, we construct linear codes over $\mathbb{Z}_4$ with bounded $GC$-content. The codes are obtained using a greedy algorithm over $\mathbb{Z}_4$. Further, upper and lower bounds are derived for the maximum size of DNA codes of length $n$ with constant $GC$-content $w$ and edit distance $d$.