广义证人集

2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI:10.1109/CCP.2011.12

G. Cohen, Sihem Mesnager

{"title":"广义证人集","authors":"G. Cohen, Sihem Mesnager","doi":"10.1109/CCP.2011.12","DOIUrl":null,"url":null,"abstract":"Given a set C of q-ary n-tuples and c 2 C, how many symbols of c suffice to distinguish it from the other elements in C ? This is a generalization of an old combinatorial problem, on which we present (asymptotically tight) bounds and variations.","PeriodicalId":167131,"journal":{"name":"2011 First International Conference on Data Compression, Communications and Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Generalized Witness Sets\",\"authors\":\"G. Cohen, Sihem Mesnager\",\"doi\":\"10.1109/CCP.2011.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a set C of q-ary n-tuples and c 2 C, how many symbols of c suffice to distinguish it from the other elements in C ? This is a generalization of an old combinatorial problem, on which we present (asymptotically tight) bounds and variations.\",\"PeriodicalId\":167131,\"journal\":{\"name\":\"2011 First International Conference on Data Compression, Communications and Processing\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 First International Conference on Data Compression, Communications and Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCP.2011.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 First International Conference on Data Compression, Communications and Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCP.2011.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

给定一个由 q-ary n 元组组成的集合 C 和 c 2 C，c 的多少个符号足以将它与 C 中的其他元素区分开来？这是一个古老的组合问题的一般化，我们提出了（渐近紧密的）边界和变式。

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

查看原文本刊更多论文

Generalized Witness Sets

Given a set C of q-ary n-tuples and c 2 C, how many symbols of c suffice to distinguish it from the other elements in C ? This is a generalization of an old combinatorial problem, on which we present (asymptotically tight) bounds and variations.

求助全文

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

来源期刊

2011 First International Conference on Data Compression, Communications and Processing

自引率

0.00%

发文量