デジタル指紋及びグループ検査に共通する組合せ構造とアルゴリズムに関する研究

科学研究費助成事業 研究成果報告書：基盤研究(C)2015-2017課題番号 : 15K0497

デジタル指紋符号の組合せ理論的新構成法に関する研究

科学研究費助成事業 研究成果報告書：基盤研究(C)2014-2017課題番号 : 2640018

Perfect Hash Families: The Generalization to Higher Indices

Perfect hash families are often represented as combinatorial arrays encoding partitions of kitems into v classes, so that every t or fewer of the items are completely separated by at least a specified number of chosen partitions. This specified number is the index of the hash family. The case when each t-set must be separated at least once has been extensively researched; they arise in diverse applications, both directly and as fundamental ingredients in a column replacement strategy for a variety of combinatorial arrays. In this paper, construction techniques and algorithmic methods for constructing perfect hash families are surveyed, in order to explore extensions to the situation when each t-set must be separated by more than one partition.https://digitalcommons.usmalibrary.org/books/1029/thumbnail.jp