Combinatorial designs in quantum information theory and digital communications
Combinatorial designs in quantum information theory and digital communications
批准号:
RGPIN-2015-04881
负责人:
Jedwab, Jonathan
金额:
$3.64万
依托单位:
依托单位国家:
加拿大
项目类别:
Discovery Grants Program - Individual
财政年份:
2018
资助国家:
加拿大
项目状态:
已结题
起止时间:
2018-01-01 至 2019-12-31
中文摘要
如果没有卫星通信、手机、便携式音乐播放器、闪存驱动器、GPS(全球定位系统)导航和电影点播等数字通信技术,现代社会将变得不可识别。这些技术变得无处不在、被广泛接受和高度可靠的一个关键原因是嵌入式数学结构和算法提供的关键支持,这些结构和算法对用户来说是不可见的。这些技术中对嵌入式数学的要求源于物理约束的组合,例如,希望有效地使用能量从一个设备向另一个设备发送信息,或者即使外部人员可以监视交换,也希望在双方之间安全地传递信息,或者即使原始信号受到噪声的破坏,也要正确地恢复传输的信息。这些物理约束的组合对应于安排受多个约束的对象的数学问题;这种问题通过组合设计来解决。*这个建议的短期目标包括使用组合设计来解决数字通信中三个众所周知的具有挑战性的问题:*(1)构造大量复杂的等角线。*(2)限制最大数量的复杂的相互无偏的基。*(3)构造具有大的渐近优点因子的二进制序列族。*寻求这些问题的完全解决方案是非常雄心勃勃的:每个问题都抵制了许多数学家、物理学家和工程师几十年来的大量努力。*问题1和2出现在量子信息论中,在传统物理不再适用的情况下,在非常小的尺度上处理信息的动态研究领域。解决这些问题将有利于量子版本的密码学(人们希望使消息难以被对手阅读)和量子版本的纠错码(相反,人们希望即使在噪声存在的情况下也能使消息更容易被他人阅读)。组合设计在解决这些问题中的重要性尚未确定,这是这一提议的一个主要创新方面。*问题3出现在传统(非量子)数字通信和统计力学中。它的解决方案将允许设计更有效的雷达和无线通信,并创造专利技术。*目的不仅是解决这些具体问题,而且这样做是为了创造新的工具和方法,用于分析与数字通信有关的广泛类别的组合结构。这与我的研究计划的长期目标相联系:结合组合、代数、分析和计算技术,从根本上改变对经典和新兴问题的研究,这些问题在实际和理论数字通信中都很重要。
英文摘要
Modern society would be unrecognizable without digital communications technologies such as satellite communication, cell phones, portable music players, flash drives, GPS (global positioning system) navigation, and movies on demand. A key reason these technologies have become ubiquitous, widely accepted, and highly dependable is the critical support provided by embedded mathematical structures and algorithms that remain invisible to the user.******The requirement for embedded mathematics in these technologies derives from a combination of physical constraints, for example the desire to send information from one device to another using energy efficiently, or to pass information securely between two parties even though outsiders can monitor the exchange, or to recover transmitted information correctly despite corruption of the original signal by noise. These combinations of physical constraints correspond to mathematical problems of arranging objects subject to multiple constraints; such problems are solved by combinatorial designs. ******The short-term objectives of this proposal involve the use of combinatorial designs to solve three notoriously challenging problems of digital communications:***(1) Construct large sets of complex equiangular lines.***(2) Constrain the largest number of complex mutually unbiased bases.***(3) Construct families of binary sequences with large asymptotic merit factor.***Seeking a complete solution to these problems is highly ambitious: each has resisted considerable effort over decades by numerous mathematicians, physicists, and engineers.******Problems 1 and 2 arise in quantum information theory, a dynamic research area dealing with the processing of information at very small scales where conventional physics no longer applies. Solving these problems would benefit the quantum version of cryptography (where one wishes to make messages difficult for an adversary to read) and the quantum version of error-correcting codes (where, on the contrary, one wishes to make messages easy for others to read even in the presence of noise). The importance of combinatorial designs in solving these problems has not yet been established, and is a major innovative aspect of this proposal.******Problem 3 arises in conventional (non-quantum) digital communications and in statistical mechanics. Its solution would allow the design of more efficient radar and wireless communications, and the creation of patentable technology.******The aim is not only to solve these specific problems, but in doing so to create new tools and methods for analyzing a wide class of combinatorial structures related to digital communications. This links to the long-term goal of my research program: to combine combinatorial, algebraic, analytical, and computational techniques to transform radically the study of classical and emerging problems that are important in practical and theoretical digital communications.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Combinatorial design theory and digital communications
-
批准号:RGPIN-2022-03110
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$3.5万
-
财政年份:2022
-
负责人:Jedwab, Jonathan
-
依托单位:
Combinatorial designs in quantum information theory and digital communications
-
批准号:RGPIN-2015-04881
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$3.64万
-
财政年份:2021
-
负责人:Jedwab, Jonathan
-
依托单位:
Combinatorial designs in quantum information theory and digital communications
-
批准号:RGPIN-2015-04881
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$3.64万
-
财政年份:2020
-
负责人:Jedwab, Jonathan
-
依托单位:
Combinatorial designs in quantum information theory and digital communications
-
批准号:RGPIN-2015-04881
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$3.64万
-
财政年份:2019
-
负责人:Jedwab, Jonathan
-
依托单位:
Combinatorial designs in quantum information theory and digital communications
-
批准号:RGPIN-2015-04881
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$3.64万
-
财政年份:2017
-
负责人:Jedwab, Jonathan
-
依托单位:
Combinatorial designs in quantum information theory and digital communications
-
批准号:RGPIN-2015-04881
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$3.64万
-
财政年份:2016
-
负责人:Jedwab, Jonathan
-
依托单位:
Combinatorial designs in quantum information theory and digital communications
-
批准号:RGPIN-2015-04881
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$3.64万
-
财政年份:2015
-
负责人:Jedwab, Jonathan
-
依托单位:
Aperiodic autocorrelation properties of sequences and arrays.
-
批准号:278420-2009
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$2.19万
-
财政年份:2014
-
负责人:Jedwab, Jonathan
-
依托单位:
Aperiodic autocorrelation properties of sequences and arrays.
-
批准号:278420-2009
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$2.19万
-
财政年份:2012
-
负责人:Jedwab, Jonathan
-
依托单位:
Aperiodic autocorrelation properties of sequences and arrays
-
批准号:380474-2009
-
项目类别:Discovery Grants Program - Accelerator Supplements
-
资助金额:$2.91万
-
财政年份:2012
-
负责人:Jedwab, Jonathan
-
依托单位:
Aperiodic autocorrelation properties of sequences and arrays
-
批准号:380474-2009
-
项目类别:Discovery Grants Program - Accelerator Supplements
-
资助金额:$2.91万
-
财政年份:2011
-
负责人:Jedwab, Jonathan
-
依托单位:
Aperiodic autocorrelation properties of sequences and arrays.
-
批准号:278420-2009
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$2.19万
-
财政年份:2011
-
负责人:Jedwab, Jonathan
-
依托单位:
Aperiodic autocorrelation properties of sequences and arrays.
-
批准号:278420-2009
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$2.19万
-
财政年份:2010
-
负责人:Jedwab, Jonathan
-
依托单位:
Aperiodic autocorrelation properties of sequences and arrays
-
批准号:380474-2009
-
项目类别:Discovery Grants Program - Accelerator Supplements
-
资助金额:$2.91万
-
财政年份:2010
-
负责人:Jedwab, Jonathan
-
依托单位:
Aperiodic autocorrelation properties of sequences and arrays.
-
批准号:278420-2009
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$2.19万
-
财政年份:2009
-
负责人:Jedwab, Jonathan
-
依托单位:
Aperiodic autocorrelation properties of sequences and arrays.
-
批准号:278420-2007
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$1.24万
-
财政年份:2008
-
负责人:Jedwab, Jonathan
-
依托单位:
Aperiodic autocorrelation properties of sequences and arrays.
-
批准号:278420-2007
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$1.24万
-
财政年份:2007
-
负责人:Jedwab, Jonathan
-
依托单位:
Exploratory computational study of discrete mathematics problems arising in digital communication
-
批准号:278420-2004
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$1.02万
-
财政年份:2006
-
负责人:Jedwab, Jonathan
-
依托单位:
Exploratory computational study of discrete mathematics problems arising in digital communication
-
批准号:278420-2004
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$1.02万
-
财政年份:2005
-
负责人:Jedwab, Jonathan
-
依托单位:
Exploratory computational study of discrete mathematics problems arising in digital communication
-
批准号:278420-2004
-
项目类别:Discovery Grants Program - Individual
-
资助金额:$1.02万
-
财政年份:2004
-
负责人:Jedwab, Jonathan
-
依托单位:
国内基金
海外基金
图的正则性和胞腔代数
-
批准号:10871027
-
项目类别:面上项目
-
资助金额:23.0万元
-
批准年份:2008
-
负责人:王恺顺
-
依托单位: