On optimal superimposed codes
SCIE
SCOPUS
- Title
- On optimal superimposed codes
- Authors
- Kim, HK; Lebedev, V
- Date Issued
- 2004-01
- Publisher
- JOHN WILEY & SONS INC
- 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.
- Keywords
- cover-free family; superimposed code; key distribution pattern; super-simple design; covering array; KEY DISTRIBUTION PATTERNS; PERFECT HASH FAMILIES; SECURE NETWORKS; FINITE SETS; CONSTRUCTIONS; STORAGE; BOUNDS; OTHERS; UNION
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/18053
- DOI
- 10.1002/JCD.10056
- ISSN
- 1063-8539
- Article Type
- Article
- Citation
- JOURNAL OF COMBINATORIAL DESIGNS, vol. 12, no. 2, page. 79 - 91, 2004-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.