WeChat Mini Program
Old Version Features

New Lower Bounds for Secure Codes and Related Hash Families: A Hypergraph Theoretical Approach

IEEE Transactions on Information Theory(2016)

Tongji Univ | Capital Normal Univ

Cited 7|Views24
Abstract
Various kinds of secure codes and their related hash families are broadly studied combinatorial structures for protecting copyrighted materials. The codewords in such a structure can be regarded as a subset of Q(N), the set of all q-ary vectors of given length N, satisfying some constraints. We use a hypergraph model to characterize the combinatorial structure. By applying a result of Duke et al. on the lower bound of the independence number of hypergraphs, we provide a new approach to evaluate the lower bounds for several kinds of secure codes and related hash families. In particular, the general method is illustrated via the examples of existence results on some perfect hash families, frameproof codes, and separable codes.
More
Translated text
Key words
Independent set,separating hash family,perfect hash family,frameproof code,separable code
PDF
Bibtex
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper
Summary is being generated by the instructions you defined