首页> 外文会议>Forty-Third Annual Allerton Conference on Communication, Control, and Computing vol.4 >WEIGHT ENUMERATORS AND A MACWILLIAMS-TYPE IDENTITY FOR SPACE-TIME RANK CODES OVER FINITE FIELDS
【24h】

WEIGHT ENUMERATORS AND A MACWILLIAMS-TYPE IDENTITY FOR SPACE-TIME RANK CODES OVER FINITE FIELDS

机译:有限域上时空编码的权重枚举和MacWilliams型恒等式

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

摘要

Several authors have considered the analogue of space-time codes over finite fields, usually taking the distance between two matrices as the rank of their difference. We introduce a weight enumerator for these "finite rank codes," and show that there is a MacWilliams-type identity connecting the weight enumerator of a linear finite rank code to that of its dual. We do so with a proof of sufficient generality that it simultaneously derives the classical MacWilliams identity for linear block codes. Finally, we demonstrate a close relationship between the MacWilliams identity for linear finite rank codes and that for linear block codes.
机译:几位作者已经考虑了有限域上的时空码的类似物,通常将两个矩阵之间的距离作为其差的等级。我们为这些“有限等级代码”引入了一个权重枚举器,并表明存在一个MacWilliams类型的身份将线性有限等级代码的权重枚举器与其对偶代数连接起来。我们以足够通用性的证明来做到这一点,即它同时得出线性分组码的经典MacWilliams身份。最后,我们证明了线性有限秩编码的MacWilliams身份与线性分组码的MacWilliams身份之间的密切关系。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号