检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Mokshi Goyal Madhu Raka Mokshi Goyal;Madhu Raka(Centre for Advanced Study in Mathematics, Panjab University, Chandigarh, India)
机构地区:[1]Centre for Advanced Study in Mathematics, Panjab University, Chandigarh, India
出 处:《Journal of Computer and Communications》2021年第5期36-57,共22页电脑和通信(英文)
摘 要:Let <i>f</i>(u) and <i>g</i>(v) be two polynomials of degree <i>k</i> and <i>l</i> respectively, not both linear which split into distinct linear factors over F<sub>q</sub>. Let <img src="Edit_83041428-d8b0-4505-8c3c-5e29f2886159.png" width="160" height="15" alt="" /> be a finite commutative non-chain ring. In this paper, we study polyadic codes and their extensions over the ring <i>R</i>. We give examples of some polyadic codes which are optimal with respect to Griesmer type bound for rings. A Gray map is defined from <img src="Edit_c75f119d-3176-4a71-a36a-354955044c09.png" width="50" height="15" alt="" /> which preserves duality. The Gray images of polyadic codes and their extensions over the ring <i>R</i> lead to construction of self-dual, isodual, self-orthogonal and complementary dual (LCD) codes over F<i><sub>q</sub></i>. Some examples are also given to illustrate this.Let <i>f</i>(u) and <i>g</i>(v) be two polynomials of degree <i>k</i> and <i>l</i> respectively, not both linear which split into distinct linear factors over F<sub>q</sub>. Let <img src="Edit_83041428-d8b0-4505-8c3c-5e29f2886159.png" width="160" height="15" alt="" /> be a finite commutative non-chain ring. In this paper, we study polyadic codes and their extensions over the ring <i>R</i>. We give examples of some polyadic codes which are optimal with respect to Griesmer type bound for rings. A Gray map is defined from <img src="Edit_c75f119d-3176-4a71-a36a-354955044c09.png" width="50" height="15" alt="" /> which preserves duality. The Gray images of polyadic codes and their extensions over the ring <i>R</i> lead to construction of self-dual, isodual, self-orthogonal and complementary dual (LCD) codes over F<i><sub>q</sub></i>. Some examples are also given to illustrate this.
关 键 词:Polyadic Codes and Their Extensions Griesmer Bound Gray Map Self-Dual and Self-Orthogonal Codes Isodual Codes LCD Codes
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.218.108.184