奇行列式和二进制帧证明码超越概率界的Hecke算子?

2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI:10.1109/CIG.2010.5592905

Hugues Randriam

{"title":"奇行列式和二进制帧证明码超越概率界的Hecke算子?","authors":"Hugues Randriam","doi":"10.1109/CIG.2010.5592905","DOIUrl":null,"url":null,"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.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Hecke operators with odd determinant and binary frameproof codes beyond the probabilistic bound?\",\"authors\":\"Hugues Randriam\",\"doi\":\"10.1109/CIG.2010.5592905\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":354925,\"journal\":{\"name\":\"2010 IEEE Information Theory Workshop\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIG.2010.5592905\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2010.5592905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

我们对由代数曲线构造的保帧码的Xing下界作了一些改进。结合一些额外的数论假设(仍然是推测性的)和串联过程，这应该导致存在一组二进制2-帧证明码的渐近速率，超出了迄今为止最著名的(非建设性)下界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 IEEE Information Theory Workshop

自引率

0.00%

发文量