DocumentCode :
1414665
Title :
Efficient constructions of frameproof codes
Author :
Cohen, G. ; Encheva, S.
Author_Institution :
ENST, Paris, France
Volume :
36
Issue :
22
fYear :
2000
fDate :
10/26/2000 12:00:00 AM
Firstpage :
1840
Lastpage :
1842
Abstract :
If C is a code of length n over a p-ary alphabet, then x is called a descendant of the codewords a, b,.... e if xi∈{ai , hi,..., ei} for i=1..., 1 n. The authors study codes with the following property: the descendant of any coalition of codewords of a given maximal size does not belong to C
Keywords :
codes; set theory; asymptotic constructions; efficient constructions; frameproof codes; linear codes;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:20001324
Filename :
888421
Link To Document :
بازگشت