Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Hecke operators with odd determinant and binary frameproof codes beyond the probabilistic bound?

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Randriam, H. ; LTCI, Telecom ParisTech, Paris, France

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.

Published in:

Information Theory Workshop (ITW), 2010 IEEE

Date of Conference:

Aug. 30 2010-Sept. 3 2010