Random Coding Bounds for DNA Codes Based on Fibonacci Ensembles of DNA Sequences

Abstract

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 2008
Accession Number
ADA499947

Entities

People

  • A. D'yachkov
  • A. Macula
  • T. Renz
  • V. Rykov

Organizations

  • Air Force Research Laboratory

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Alphabets
  • Construction
  • Electronic Mail
  • Equations
  • Genetic Structures
  • Government Employees
  • Governments
  • Hybridization
  • Inequalities
  • Information Theory
  • Mathematics
  • Numbers
  • Real Numbers
  • Sequences
  • Theorems

Fields of Study

  • Mathematics

Readers

  • Computational Modeling and Simulation
  • Graph Algorithms and Convex Optimization.
  • Oncology and Biomarker-Based Cancer Detection.