【24h】

Golay Pairs Having Larger Swap Sets

机译:Golay对具有更大的交换套

获取原文
获取原文并翻译 | 示例
           

摘要

Binary Golay pairs are examined with an interest in finding examples, in which members of the pair can be replaced with other codes sharing the same autocorrelation, but not due to negation and reversal. These are referred to as shared-autocorrelation (or shared-ACS) Golay pairs. Golay pairs can always formed from other Golay pairs by reversing and/or negating codes in those pairs; the discovery of other possibilities offers the promise of enhanced unpredictability by waveform diversity. A 1998 paper by Djokovic, which lists such pairs at lengths 32 and 40, is used as evidence that such pairs not only exist, but also likely exist in significant numbers. A common structure in these codes is determined, and conditions found for half-codes that can be employed to form larger examples. Furthermore, a necessary condition is found for code lengths allowing these shared-ACS Golay pairs.
机译:使用对查找示例的兴趣进行兴趣检查二进制Golay对,其中该对的成员可以用共享相同自相关的其他代码替换,但不是由于否定和逆转。这些被称为共享自相关(或共享-ACS)Golay对。 Golay对可以始终通过在这些对中倒转和/或否定代码来由其他Golay对形成;发现其他可能性的发现提供了通过波形多样性提高不可预测性的承诺。 Djokovic的一份1998年纸张,其中在长度32和40处列出了这种对,作为这些对不仅存在的证据,但也可能存在于大量数字中。确定这些代码中的共同结构,并且对可以采用的半代码的条件来形成更大的例子。此外,找到了必要的条件用于代码长度允许这些共享-ACS Golay对。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号