Some new p-ary two-secure frameproof codes Original Research Article

If C is a p-ary code of length n and a(1) and a(2) are two codewords, then a(3) is called a descendant of a(1) and a(2) if ai(3) ∈ {ai(1), ai(2)} for i = 1,…, n. We are interested in codes C with the property that either any two nonintersecting coalitions of size 2 have no common descendant or the descendant of any coalition of size 3 does not belong to the code. We construct such codes based on Hadamard matrices.