TY - GEN
T1 - New construction of DNA codes with constant-GC contents from binary sequences with ideal autocorrelation
AU - Kim, Young Sik
AU - Kim, Sang Hyo
PY - 2011
Y1 - 2011
N2 - In this paper, we provides a coding theoretic construction of DNA codes. Previously, some works have been carried out on DNA codes with biologically motivated constraints such as minimum Hamming distance and constant GC-content. Therefore, for given code-length N, the number of GC-content w, and minimum hamming distance d, it is interesting to construct DNA codes with maximum size A4GC (N, w, d). In the previous works, the DNA codes from the quaternary constant weight codes have been proposed [5]. In this paper, we propose another approach based on the binary constant weight codes, not quaternary ones. It is found that the size of the new DNA codes from binary constant weight codes is greater than or equal to that from the quaternary ones. First a general approach to constructing DNA codes from a binary constant weight code is proposed. Second, a specific DNA code with parameters (2 n -1, 2n-1, -2n-1) from binary sequences with ideal autocorrelation property is constructed.
AB - In this paper, we provides a coding theoretic construction of DNA codes. Previously, some works have been carried out on DNA codes with biologically motivated constraints such as minimum Hamming distance and constant GC-content. Therefore, for given code-length N, the number of GC-content w, and minimum hamming distance d, it is interesting to construct DNA codes with maximum size A4GC (N, w, d). In the previous works, the DNA codes from the quaternary constant weight codes have been proposed [5]. In this paper, we propose another approach based on the binary constant weight codes, not quaternary ones. It is found that the size of the new DNA codes from binary constant weight codes is greater than or equal to that from the quaternary ones. First a general approach to constructing DNA codes from a binary constant weight code is proposed. Second, a specific DNA code with parameters (2 n -1, 2n-1, -2n-1) from binary sequences with ideal autocorrelation property is constructed.
UR - https://www.scopus.com/pages/publications/80054810661
U2 - 10.1109/ISIT.2011.6033808
DO - 10.1109/ISIT.2011.6033808
M3 - Conference contribution
AN - SCOPUS:80054810661
SN - 9781457705953
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1569
EP - 1573
BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Y2 - 31 July 2011 through 5 August 2011
ER -