DNA codes for generalized stem similarity

A. Dyachkov, Ju Volkova, N. Polyanskii

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The concept of a generalized stem similarity function and the corresponding DNA codes are introduced. We give parameters for some optimal constructions called maximum distance separable DNA codes and obtain bounds on the maximum size of DNA codes.

Original languageEnglish
Title of host publication2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages1564-1568
Number of pages5
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation
Duration: 31 Jul 20115 Aug 2011

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8104

Conference

Conference2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Country/TerritoryRussian Federation
CitySt. Petersburg
Period31/07/115/08/11

Fingerprint

Dive into the research topics of 'DNA codes for generalized stem similarity'. Together they form a unique fingerprint.

Cite this