{"id":"https://openalex.org/W2002087984","doi":"https://doi.org/10.1137/s0895480196304246","title":"Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes","display_name":"Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes","publication_year":1998,"publication_date":"1998-02-01","ids":{"openalex":"https://openalex.org/W2002087984","doi":"https://doi.org/10.1137/s0895480196304246","mag":"2002087984"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480196304246","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480196304246","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021938024","display_name":"Douglas R. Stinson","orcid":"https://orcid.org/0000-0001-5635-8122"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. R. Stinson","raw_affiliation_strings":["#N##TAB##TAB##TAB##TAB# University of Nebraska-Lincoln#N##TAB##TAB##TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# University of Nebraska-Lincoln#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081822939","display_name":"Ruizhong Wei","orcid":"https://orcid.org/0000-0003-2070-9773"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Wei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":16.3536,"has_fulltext":false,"cited_by_count":286,"citation_normalized_percentile":{"value":0.99460134,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"11","issue":"1","first_page":"41","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/traceability","display_name":"Traceability","score":0.7784786224365234},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.6539193987846375},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6475527286529541},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6306706666946411},{"id":"https://openalex.org/keywords/combinatorial-design","display_name":"Combinatorial design","score":0.5967918634414673},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5098447203636169},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5089569091796875},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5088194012641907},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.507075309753418},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47497957944869995},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46237868070602417},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4146277904510498},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37745553255081177},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3010324239730835},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2544870972633362},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.11846303939819336},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.08245125412940979}],"concepts":[{"id":"https://openalex.org/C153876917","wikidata":"https://www.wikidata.org/wiki/Q899704","display_name":"Traceability","level":2,"score":0.7784786224365234},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.6539193987846375},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6475527286529541},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6306706666946411},{"id":"https://openalex.org/C122451846","wikidata":"https://www.wikidata.org/wiki/Q5150824","display_name":"Combinatorial design","level":2,"score":0.5967918634414673},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5098447203636169},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5089569091796875},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5088194012641907},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.507075309753418},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47497957944869995},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46237868070602417},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4146277904510498},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37745553255081177},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3010324239730835},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2544870972633362},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.11846303939819336},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.08245125412940979},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0895480196304246","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480196304246","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.108.8687","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.8687","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dcis.uohyd.ernet.in/courses/SS/ss-papers/IDRBT-SS/03MCMB16/Reference Material/Combinatorial_properties_and_constructions_of_frameproof_cod.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.53.4537","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.4537","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://bibd.unl.edu/~stinson/newframeproof.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.1179","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.1179","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cacr.math.uwaterloo.ca/~rwei/ntsfc.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1599335667","https://openalex.org/W1639643357","https://openalex.org/W1965142549","https://openalex.org/W1989682699","https://openalex.org/W2045554673","https://openalex.org/W2074728115","https://openalex.org/W2114972298","https://openalex.org/W2141420453","https://openalex.org/W2146170623","https://openalex.org/W2164604747","https://openalex.org/W2250783959","https://openalex.org/W2911546054","https://openalex.org/W2991692345","https://openalex.org/W4230677855","https://openalex.org/W4246456962","https://openalex.org/W4251670373"],"related_works":["https://openalex.org/W2943247777","https://openalex.org/W2740543340","https://openalex.org/W2371167013","https://openalex.org/W1582340598","https://openalex.org/W1541021634","https://openalex.org/W2779867339","https://openalex.org/W2794545997","https://openalex.org/W2584980534","https://openalex.org/W2182731056","https://openalex.org/W66917582"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,128],"investigate":[4,103],"combinatorial":[5,31,88],"properties":[6],"and":[7,22,42,83,97,108],"constructions":[8,79],"of":[9,13,33,39,48,64,71,80,105,139],"two":[10,35],"recent":[11],"topics":[12],"cryptographic":[14],"interest,":[15],"namely":[16],"frameproof":[17,49,81,106],"codes":[18,50,82,107],"for":[19,25,137],"digital":[20],"fingerprinting":[21],"traceability":[23,84,109],"schemes":[24,85],"broadcast":[26],"encryption.":[27],"We":[28,75,101],"first":[29],"give":[30,77],"descriptions":[32],"these":[34,57,140],"objects":[36],"in":[37],"terms":[38],"set":[40],"systems":[41],"also":[43,102],"discuss":[44],"the":[45,69],"Hamming":[46],"distance":[47],"when":[51],"viewed":[52],"as":[53,91],"error-correcting":[54,95],"codes.":[55],"From":[56],"descriptions,":[58],"it":[59],"is":[60],"seen":[61],"that":[62],"existence":[63,70,138],"a":[65,72,113,120],"c-traceability":[66],"scheme":[67,115],"implies":[68],"c-frameproof":[73],"code.":[74],"then":[76],"several":[78],"by":[86],"using":[87],"structures":[89],"such":[90],"t-designs,":[92],"packing":[93],"designs,":[94],"codes,":[96],"perfect":[98],"hash":[99],"families.":[100],"embeddings":[104],"schemes,":[110],"which":[111,133],"allow":[112],"given":[114],"to":[116,123],"be":[117],"expanded":[118],"at":[119,131],"later":[121],"date":[122],"accommodate":[124],"more":[125],"users.":[126],"Finally,":[127],"look":[129],"briefly":[130],"bounds":[132],"establish":[134],"necessary":[135],"conditions":[136],"structures.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":12}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}