Mathematical Sciences: Large Sets of Disjoint Designs with Holes

数学科学：大量带孔的不相交设计

• 批准号: 9123727
• 负责人: Luc Teirlinck
• 金额: $ 2.9万
• 依托单位: Auburn University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1992
• 资助国家: 美国
• 起止时间: 1992-05-01 至 1996-10-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9123727&HistoricalAwards=false
• 关键词: Mathematical; Sciences; Large; Sets; Disjoint

This award supports the research of Professor L. Teirlinck to work in combinatorics. He intends to work on the large sets of disjoint designs and related structures. In particular, he intends to continue his research on t-designs. The research crosses lines between the areas of combinatorics, and coding theory. Combinatorics attempts to find efficient methods to study how discrete collections of objects can be organized. And, so it is extremely important to modern communications, for example the design of large networks as in telephone systems. The main object to be studied in the proposed research, t-designs are a fundamental tool used in the foundations of authenticity theory in cryptography.

该奖项支持 L. Teirlinck 教授在组合学方面的研究。 他打算研究大量不相交的设计和相关结构。 他特别打算继续他对 T 型设计的研究。 该研究跨越了组合学和编码理论领域。 组合学试图找到有效的方法来研究如何组织离散的对象集合。 因此，它对于现代通信极其重要，例如电话系统中的大型网络的设计。 T 设计是本研究的主要研究对象，它是密码学真实性理论基础中使用的基本工具。