Greedy Construction of DNA Codes and New Bounds

preprint2015arXivOpen access

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$ .

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Greedy Construction of DNA Codes and New Bounds

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0