the aim of this paper is to improve the performance of the conventional goertzel algorithm in determining the protein codingregions in deoxyribonucleic acid (dna) sequences. first, the symbolic dna sequences are converted into numerical signals usingelectron ion interaction potential method. then by combining the modified anti-notch filter and linear predictive coding model,we proposed an effic...

An optimal linear coding solution for index coding problem is established. Instead of network coding approach by focus on graph theoric and algebraic methods a linear coding program for solving both unicast and groupcast index coding problem is presented. The coding is proved to be the optimal solution from the linear perspective and can be easily utilize for any number of messages. The importa...

Using tools from algebraic geometry and Gröbner basis theory we solve two problems in network coding. First we present a method to determine the smallest field size for which linear network coding is feasible. Second we derive improved estimates on the success probability of random linear network coding. These estimates take into account which monomials occur in the support of the determinant o...

Given the n-dimensional space Fq , the elements of the projective spaces are all subspaces of Fq . Recently these codes have found application in error-correction of network coding. In this paper we examine a few interesting aspects of coding theory in projective spaces. We present codes and bounds in the projective spaces metric and prove that there are no perfect codes in this metric. We cons...