Title :
Hecke operators with odd determinant and binary frameproof codes beyond the probabilistic bound?
Author :
Randriam, Hugues
Author_Institution :
LTCI, Telecom ParisTech, Paris, France
fDate :
Aug. 30 2010-Sept. 3 2010
Abstract :
We give a slight improvement on Xing´s lower bound for frameproof codes constructed from algebraic curves. Combined with some additional number-theoretic assumptions (still conjectural) and a concatenation process, this should lead to the existence of a family of binary 2-frameproof codes of asymptotic rate going beyond the up to now best known (non-constructive) lower bound.
Keywords :
binary codes; Hecke operators; Xing lower bound; algebraic curves; binary frameproof codes; concatenation process; odd determinant; Binary codes; Cryptography; Jacobian matrices; Linear code; Poles and towers; Probabilistic logic; Upper bound;
Conference_Titel :
Information Theory Workshop (ITW), 2010 IEEE
Conference_Location :
Dublin
Print_ISBN :
978-1-4244-8262-7
Electronic_ISBN :
978-1-4244-8263-4
DOI :
10.1109/CIG.2010.5592905
