Random Coding Bounds for DNA Codes Based on Fibonacci Ensembles of DNA Sequences
In-House Conference Technical Paper Post-Print
AIR FORCE RESEARCH LAB ROME NY INFORMATION DIRECTORATE
Pagination or Media Count:
We consider the concept of a weighted 2-stem similarity function between two DNA sequences and discuss DNA codes based on the similarity. An optimal construction of such codes is suggested. A random coding bound on the rate of DNA codes is proved. To obtain the bound, we use some ensembles of DNA sequences which are generalizations of the Fibonacci sequences.
- Numerical Mathematics