The encoding problem is a most fundamental issue in DNAbased computing,and lots of experiments have shown that the reliability of this new paradigm can be improved significantly through appropriate encoding strategy.This paper introduces various constraints and the relation between them and the number of words might attained over three-letter alphabet {A,T,C}.Then we present a construction algorithm based on linear codes.Finally,we point out some problems and directions needed further studying.