DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, HK | - |
dc.contributor.author | Lebedev, V | - |
dc.date.accessioned | 2016-03-31T12:34:31Z | - |
dc.date.available | 2016-03-31T12:34:31Z | - |
dc.date.created | 2009-02-28 | - |
dc.date.issued | 2004-01 | - |
dc.identifier.issn | 1063-8539 | - |
dc.identifier.other | 2004-OAK-0000004074 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/18053 | - |
dc.description.abstract | A (w,r) cover-free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A binary (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as a concept of key distribution patterns. In this paper, we develop a method of constructing superimposed codes and prove that some superimposed codes constructed in this way are optimal. (C) 2003 Wiley Periodicals, Inc. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | JOHN WILEY & SONS INC | - |
dc.relation.isPartOf | JOURNAL OF COMBINATORIAL DESIGNS | - |
dc.subject | cover-free family | - |
dc.subject | superimposed code | - |
dc.subject | key distribution pattern | - |
dc.subject | super-simple design | - |
dc.subject | covering array | - |
dc.subject | KEY DISTRIBUTION PATTERNS | - |
dc.subject | PERFECT HASH FAMILIES | - |
dc.subject | SECURE NETWORKS | - |
dc.subject | FINITE SETS | - |
dc.subject | CONSTRUCTIONS | - |
dc.subject | STORAGE | - |
dc.subject | BOUNDS | - |
dc.subject | OTHERS | - |
dc.subject | UNION | - |
dc.title | On optimal superimposed codes | - |
dc.type | Article | - |
dc.contributor.college | 수학과 | - |
dc.identifier.doi | 10.1002/JCD.10056 | - |
dc.author.google | Kim, HK | - |
dc.author.google | Lebedev, V | - |
dc.relation.volume | 12 | - |
dc.relation.issue | 2 | - |
dc.relation.startpage | 79 | - |
dc.relation.lastpage | 91 | - |
dc.contributor.id | 10053705 | - |
dc.relation.journal | JOURNAL OF COMBINATORIAL DESIGNS | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCI | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | JOURNAL OF COMBINATORIAL DESIGNS, v.12, no.2, pp.79 - 91 | - |
dc.identifier.wosid | 000189308400001 | - |
dc.date.tcdate | 2019-01-01 | - |
dc.citation.endPage | 91 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 79 | - |
dc.citation.title | JOURNAL OF COMBINATORIAL DESIGNS | - |
dc.citation.volume | 12 | - |
dc.contributor.affiliatedAuthor | Kim, HK | - |
dc.identifier.scopusid | 2-s2.0-1542334771 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 42 | - |
dc.description.scptc | 43 | * |
dc.date.scptcdate | 2018-05-121 | * |
dc.type.docType | Article | - |
dc.subject.keywordPlus | KEY DISTRIBUTION PATTERNS | - |
dc.subject.keywordPlus | PERFECT HASH FAMILIES | - |
dc.subject.keywordPlus | SECURE NETWORKS | - |
dc.subject.keywordPlus | FINITE SETS | - |
dc.subject.keywordPlus | CONSTRUCTIONS | - |
dc.subject.keywordPlus | STORAGE | - |
dc.subject.keywordPlus | BOUNDS | - |
dc.subject.keywordPlus | OTHERS | - |
dc.subject.keywordPlus | UNION | - |
dc.subject.keywordAuthor | cover-free family | - |
dc.subject.keywordAuthor | superimposed code | - |
dc.subject.keywordAuthor | key distribution pattern | - |
dc.subject.keywordAuthor | super-simple design | - |
dc.subject.keywordAuthor | covering array | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.