首页> 外文期刊>Journal of Combinatorial Theory, Series A >Enumeration of certain affine invariant extended cyclic codes
【24h】

Enumeration of certain affine invariant extended cyclic codes

机译:某些仿射不变扩展循环码的枚举

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

摘要

Let p be a prime and let r, e, m be positive integers such that r vertical bar e and elm. Extended cyclic codes of length p(m) over F-p(r) which are invariant under AGL(m/e, F-p(e)) are characterized by a well-known relation e on the set (0, 1,..., p(m) - 1). From the relation e, we derive a partial order < in U = {0, 1,..., m/e(p - 1)}(e) defined by an e-dimensional simplicial cone. We show that the aforementioned extended cyclic codes can be enumerated by the ideals of (U, <) which are invariant under the rth power of a circulant permutation matrix. When e = 2, we enumerate all such invariant ideals by describing their boundaries. Explicit formulas are obtained for the total number of AGL(m/2, F-p(2))-invariant extended cyclic codes of length p(m) over Fpr and for the dimensions of such codes. We also enumerate all self-dual AGL(m/2, F-2(2))-invariant extended cyclic codes of length 2(m) over F-2(2) where m/2 is odd; the restrictions on the parameters are necessary conditions for the existence of self-dual affine invariant extended cyclic codes with e = 2. (c) 2004 Elsevier Inc. All rights reserved.
机译:令p为质数,令r,e,m为正整数,使得r垂直线e和elm。在AGL(m / e,Fp(e))下不变的,在Fp(r)上长度为p(m)的扩展循环码的特征在于集合(0,1 ,.)上的公知关系 e。 。,p(m)-1)。从关系 e,我们得出由e维简单锥定义的U = {0,1,...,m / e(p-1)}(e)中的偏序<。我们表明,上述扩展循环码可以由(U,<)的理想枚举,该理想在循环置换矩阵的r次方下不变。当e = 2时,我们通过描述它们的边界来枚举所有这些不变的理想。对于在Fpr上长度为p(m)的AGL(m / 2,F-p(2))-不变扩展循环码的总数以及此类码的尺寸,可以获得明确的公式。我们还列举了在F-2(2)上长度为2(m)的所有自对偶AGL(m / 2,F-2(2))-不变扩展循环码,其中m / 2为奇数;参数的限制是存在e = 2的自对偶仿射不变扩展循环码的必要条件。(c)2004 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号