Abstract :
If C is a code of length n over a p-ary alphabet, then x is called a descendant of the code-words a,b,…,e if xi ∈{a i,bi,…,ei} for i=1,…,n. We study codes with the following property: the descendant of any coalition of codewords of a given maximal size does not belong to C
Keywords :
Golay codes; binary codes; linear codes; Golay code; binary frameproof codes; broadcast encryption model; code length; codewords; efficient code construction; linear codes; maximal code size; pirate decoder; Binary codes; Broadcasting; Cryptography; Decoding; Fingerprint recognition; Linear code; Vectors;
