{"title":"关于(3,1)和(3,2)分离系统的注释以及(3,1)分离系统的界","authors":"B. Rega, C. Durairajan","doi":"10.1142/s179383092250149x","DOIUrl":null,"url":null,"abstract":"Separating codes have been studied due to their applications to digital finger printing, the state assignments, automata theory and to construct hash functions. In this paper, we study the necessary and sufficient conditions for a code to be a [Formula: see text] and [Formula: see text]-separating systems for q-ary level and also satisfy its intersecting properties. We also construct a bound for [Formula: see text] separating system.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"96 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2022-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system\",\"authors\":\"B. Rega, C. Durairajan\",\"doi\":\"10.1142/s179383092250149x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Separating codes have been studied due to their applications to digital finger printing, the state assignments, automata theory and to construct hash functions. In this paper, we study the necessary and sufficient conditions for a code to be a [Formula: see text] and [Formula: see text]-separating systems for q-ary level and also satisfy its intersecting properties. We also construct a bound for [Formula: see text] separating system.\",\"PeriodicalId\":45568,\"journal\":{\"name\":\"Discrete Mathematics Algorithms and Applications\",\"volume\":\"96 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Algorithms and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s179383092250149x\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s179383092250149x","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system
Separating codes have been studied due to their applications to digital finger printing, the state assignments, automata theory and to construct hash functions. In this paper, we study the necessary and sufficient conditions for a code to be a [Formula: see text] and [Formula: see text]-separating systems for q-ary level and also satisfy its intersecting properties. We also construct a bound for [Formula: see text] separating system.