ISSN 0032-9460, Problems of Information Transmission, 2006, Vol. 42, No. 2, p. 166. c Pleiades Publishing, Inc., 2006. Original Russian Text c A.G. D’yachkov, P.A. Vilenkin, I.K. Ismagilov, R.S. Sarbaev, A. Macula, D. Torney, S. White, 2006, published in Problemy Peredachi Informatsii, 2006, Vol. 42, No. 2, p. 109. LETTERS TO THE EDITOR Remark on “On DNA Codes” Published in Probl. Peredachi Inf., 2005, no. 4 A. G. D’yachkov, P. A. Vilenkin, I. K. Ismagilov, R. S. Sarbaev, A. Macula, D.Torney, and S.White DOI: 10.1134/S0032946006020104 In the paper “On DNA Codes” (Probl. Peredachi Inf., 2005, vol. 41, no. 4, pp. 349–367), the assertion of Theorem 4 can be strengthened as follows: There exists a q-ary DNA code of length n, distance D =1, block similarity n − D − 1= n − 2, and size n−1 q + q /2 if n = kq, k =1, 3, 5,... , n−1 m m+k q /2 if q =2 ,n =2 ,k ≥ 1, N = ⎪ n/2+1 q − 1 n−1 q − /2 if n = kq, k =2, 4, 6,... . q − 1 The validity of this statement obviously follows from the arguments of the paper given in the proof of Theorem 4 if one takes into account Lemma 12, which states that a parity-check code does not contain self-reverse-complement sequences for n = kq, k =1, 3, 5,... . February 8, 2006. A.G. D’yachkov, P.A. Vilenkin, I.K. Ismagilov, R.S. Sarbaev, A. Macula, D. Torney, S. White
Problems of Information Transmission – Springer Journals
Published: Jul 7, 2006
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud