RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2010 Volume 46, Issue 1, Pages 9–19 (Mi ppi2006)

This article is cited in 2 papers

Coding Theory

On volumes of spheres for the stem distance

A. N. Voronina

M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: For any two $q$-ary sequences $x$ and $y$, the stem similarity between them is defined as a total number of stems (blocks of length 2 consisting of adjacent elements of $x$ and $y$) in their longest common Hamming subsequence. For $q=4$ this similarity function and the corresponding distance function arise in molecular biology in describing an additive mathematical model of thermodynamic distance between DNA sequences. In the present paper, we derive explicit formulas for sphere sizes in this metric and consider their asymptotics in the case of spheres of a constant radius. Based on these results, we also obtain a random coding bound and Hamming bound for the optimal size of the so-called DNA codes for the case of a constant distance.

UDC: 621.391.15

Received: 03.09.2009
Revised: 14.01.2010


 English version:
Problems of Information Transmission, 2010, 46:1, 7–16

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026