...
【24h】

On modules with cyclic socle

机译:在具有循环底脚的模块上

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

摘要

The extension problem for linear codes over modules with respect to Hamming weight was already settled in [J. A. Wood, Code equivalence characterizes finite Frobenius rings, Proc. Amer. Math. Soc. 136 (2008) 699-706; Foundations of linear codes defined over finite modules: The extension theorem and MacWilliams identities, in Codes Over Rings, Series on Coding Theory and Cryptology, Vol. 6 (World Scientific, Singapore, 2009), pp. 124-190]. A similar problem arises naturally with respect to symmetrized weight compositions (SWC). In 2009, Wood proved that Frobenius bimodules have the extension property (EP) for SWC. More generally, in [N. ElGarem, N. Megahed and J. A. Wood, The extension theorem with respect to symmetrized weight compositions, in 4th Int. Castle Meeting on Coding Theory and Applications (2014)], it is shown that having a cyclic socle is sufficient for satisfying the property, while the necessity remained an open question. Here, landing in midway, a partial converse is proved. For a (not small) class of finite module alphabets, the cyclic socle is shown necessary to satisfy the EP. The idea is bridging to the case of Hamming weight through a new weight function.
机译:关于线性编码在模块上相对于汉明权重的扩展问题已经在[J. Phys.Lett。 A. Wood,代码对等表示有限的Frobenius环,Proc。阿米尔。数学。 Soc。 136(2008)699-706;在有限模块上定义的线性代码的基础:扩展定理和MacWilliams身份,在“环上的代码”中,“编码理论和密码学系列”,第1卷。 6(世界科学,新加坡,2009年),第124-190页。关于对称重量组合物(SWC),自然会出现类似的问题。在2009年,Wood证明Frobenius双模块具有SWC的扩展属性(EP)。更普遍地,在[N. ElGarem,N。Megahed和J. A. Wood,关于对称重量成分的扩展定理,第4版。关于编码理论和应用的城堡会议(2014年)]表明,具有循环的鞋底足以满足该特性,而必要性仍然是一个悬而未决的问题。在此,在中途着陆时,证明了部分逆转。对于一类(不小的)有限模块字母,显示为满足EP所必需的循环脚架。这个想法是通过新的权重函数将汉明权重的情况桥接起来。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号