New Progress To Distinguish The Parent Code

If C is a q-ary code of length n and a and b are two codeswards, then c is called a desendant of a and b if Ci {ai, bi} , for i = 1, 2,n, We are interested in code C with the property that, given any descendant c, one can always identify at lest one of the parent codewards in C. Hend D. L. Hollmann e.t. studied the bounds on F(n,q), the maximal cadinality of a code C with this property, which is the identifiable parent property. Such codes play a role in schemes that protect against piracy of software. The value of F(3,q) and it's encoding methed had been got in . This papercontinue her work on F(4,n) and obtained it's accurate value and encoding rnethed.