论平衡复正交设计的唯一性

IF 1.4 2区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Designs, Codes and Cryptography Pub Date : 2024-09-03 DOI:10.1007/s10623-024-01483-x

Yiwen Gao, Yuan Li, Haibin Kan

{"title":"论平衡复正交设计的唯一性","authors":"Yiwen Gao, Yuan Li, Haibin Kan","doi":"10.1007/s10623-024-01483-x","DOIUrl":null,"url":null,"abstract":"Complex orthogonal designs (CODs) have been used to construct space-time block codes. Its real analog, real orthogonal designs, or equivalently, sum of squares composition formula, have a long history in mathematics. Driven by some practical considerations, Adams et al. (IEEE Trans Info Theory, 57(4):2254–2262, 2011) introduced the definition of balanced complex orthogonal designs (BCODs). The code rate of BCODs is 1/2, and their minimum decoding delay is proven to be \\(2^m\\), where 2m is the number of columns. We prove, when the number of columns is fixed, all (indecomposable) balanced complex orthogonal designs (BCODs) have the same parameters \\([2^m, 2m, 2^{m-1}]\\), and moreover, they are all equivalent.\n","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"21 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the uniqueness of balanced complex orthogonal design\",\"authors\":\"Yiwen Gao, Yuan Li, Haibin Kan\",\"doi\":\"10.1007/s10623-024-01483-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Complex orthogonal designs (CODs) have been used to construct space-time block codes. Its real analog, real orthogonal designs, or equivalently, sum of squares composition formula, have a long history in mathematics. Driven by some practical considerations, Adams et al. (IEEE Trans Info Theory, 57(4):2254–2262, 2011) introduced the definition of balanced complex orthogonal designs (BCODs). The code rate of BCODs is 1/2, and their minimum decoding delay is proven to be \\\\(2^m\\\\), where 2m is the number of columns. We prove, when the number of columns is fixed, all (indecomposable) balanced complex orthogonal designs (BCODs) have the same parameters \\\\([2^m, 2m, 2^{m-1}]\\\\), and moreover, they are all equivalent.\\n\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":\"21 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Designs, Codes and Cryptography\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10623-024-01483-x\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01483-x","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

复正交设计（COD）已被用于构建时空块编码。它的实际类似物--实正交设计，或等价于平方和组成公式，在数学中有着悠久的历史。出于一些实际考虑，亚当斯等人（IEEE Trans Info Theory, 57(4):2254-2262, 2011）提出了平衡复正交设计（BCODs）的定义。BCODs 的码率是 1/2 ，其最小解码延迟被证明为 \(2^m\)，其中 2m 是列数。我们证明，当列数固定时，所有（不可分解的）平衡复正交设计（BCODs）具有相同的参数（[2^m, 2m, 2^{m-1}]），而且，它们都是等价的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the uniqueness of balanced complex orthogonal design

Complex orthogonal designs (CODs) have been used to construct space-time block codes. Its real analog, real orthogonal designs, or equivalently, sum of squares composition formula, have a long history in mathematics. Driven by some practical considerations, Adams et al. (IEEE Trans Info Theory, 57(4):2254–2262, 2011) introduced the definition of balanced complex orthogonal designs (BCODs). The code rate of BCODs is 1/2, and their minimum decoding delay is proven to be \(2^m\), where 2m is the number of columns. We prove, when the number of columns is fixed, all (indecomposable) balanced complex orthogonal designs (BCODs) have the same parameters \([2^m, 2m, 2^{m-1}]\), and moreover, they are all equivalent.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Designs, Codes and Cryptography 工程技术-计算机：理论方法

CiteScore

2.80

自引率

12.50%

发文量

157

审稿时长

16.5 months

期刊介绍： Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines. The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome. The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas. Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.