Open Access System for Information Sharing

Login Library
검색

  Department of Mathematics (수학과) 1. Journal Papers

 

Article
Cited 49 time in webofscience Cited 57 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorKim, HK-
dc.contributor.authorLebedev, V-
dc.date.accessioned2016-03-31T12:34:31Z-
dc.date.available2016-03-31T12:34:31Z-
dc.date.created2009-02-28-
dc.date.issued2004-01-
dc.identifier.issn1063-8539-
dc.identifier.other2004-OAK-0000004074-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/18053-
dc.description.abstractA (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.statementofresponsibilityX-
dc.languageEnglish-
dc.publisherJOHN WILEY & SONS INC-
dc.relation.isPartOfJOURNAL OF COMBINATORIAL DESIGNS-
dc.subjectcover-free family-
dc.subjectsuperimposed code-
dc.subjectkey distribution pattern-
dc.subjectsuper-simple design-
dc.subjectcovering array-
dc.subjectKEY DISTRIBUTION PATTERNS-
dc.subjectPERFECT HASH FAMILIES-
dc.subjectSECURE NETWORKS-
dc.subjectFINITE SETS-
dc.subjectCONSTRUCTIONS-
dc.subjectSTORAGE-
dc.subjectBOUNDS-
dc.subjectOTHERS-
dc.subjectUNION-
dc.titleOn optimal superimposed codes-
dc.typeArticle-
dc.contributor.college수학과-
dc.identifier.doi10.1002/JCD.10056-
dc.author.googleKim, HK-
dc.author.googleLebedev, V-
dc.relation.volume12-
dc.relation.issue2-
dc.relation.startpage79-
dc.relation.lastpage91-
dc.contributor.id10053705-
dc.relation.journalJOURNAL OF COMBINATORIAL DESIGNS-
dc.relation.indexSCI급, SCOPUS 등재논문-
dc.relation.sciSCI-
dc.collections.nameJournal Papers-
dc.type.rimsART-
dc.identifier.bibliographicCitationJOURNAL OF COMBINATORIAL DESIGNS, v.12, no.2, pp.79 - 91-
dc.identifier.wosid000189308400001-
dc.date.tcdate2019-01-01-
dc.citation.endPage91-
dc.citation.number2-
dc.citation.startPage79-
dc.citation.titleJOURNAL OF COMBINATORIAL DESIGNS-
dc.citation.volume12-
dc.contributor.affiliatedAuthorKim, HK-
dc.identifier.scopusid2-s2.0-1542334771-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.wostc42-
dc.description.scptc43*
dc.date.scptcdate2018-05-121*
dc.type.docTypeArticle-
dc.subject.keywordPlusKEY DISTRIBUTION PATTERNS-
dc.subject.keywordPlusPERFECT HASH FAMILIES-
dc.subject.keywordPlusSECURE NETWORKS-
dc.subject.keywordPlusFINITE SETS-
dc.subject.keywordPlusCONSTRUCTIONS-
dc.subject.keywordPlusSTORAGE-
dc.subject.keywordPlusBOUNDS-
dc.subject.keywordPlusOTHERS-
dc.subject.keywordPlusUNION-
dc.subject.keywordAuthorcover-free family-
dc.subject.keywordAuthorsuperimposed code-
dc.subject.keywordAuthorkey distribution pattern-
dc.subject.keywordAuthorsuper-simple design-
dc.subject.keywordAuthorcovering array-
dc.relation.journalWebOfScienceCategoryMathematics-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaMathematics-
Show simple item record

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Communities & Collection

Related Researcher

Researcher

김현광KIM, HYUN KWANG
Dept of Mathematics
Read more

Views & Downloads

개인정보처리방침 Personal Information Protection Policy

library@postech.ac.kr Tel: 054-279-2548

Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.

Browse

Login Library Help