当前位置: X-MOL 学术Discret. Math. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On the b-distance of repeated-root constacyclic codes of prime power lengths
Discrete Mathematics ( IF 0.7 ) Pub Date : 2020-04-01 , DOI: 10.1016/j.disc.2019.111780
Hai Q. Dinh , Xiaoqiang Wang , Hongwei Liu , Songsak Sriboonchitta

Abstract Let p be a prime, s , m be positive integers, λ be a nonzero element of the finite field F p m . The b -distance generalizes the Hamming distance ( b = 1 ) , and the symbol-pair distance ( b = 2 ) . While the Hamming and symbol-pair distances of all λ -constacyclic codes of length p s are completely determined, the general b -distance of such codes was left opened. In this paper, we provide a new technique to establish the b -distance of all λ -constacyclic codes of length p s , where 1 ≤ b ≤ ⌊ p 2 ⌋ . As an application, all MDS b -symbol constacyclic codes of length p s over F p m are obtained.

中文翻译:

关于质数幂长度的重根恒环码的b距离

摘要 令 p 为素数,s ,m 为正整数,λ 为有限域 F pm 的非零元素。b 距离概括了汉明距离 (b = 1) 和符号对距离 (b = 2)。虽然所有长度为 ps 的 λ -恒循环码的汉明距离和符号对距离都已完全确定,但这些代码的一般 b 距离仍然是开放的。在本文中,我们提供了一种新技术来建立所有长度为 ps 的 λ 恒环码的 b 距离,其中 1 ≤ b ≤ ⌊ p 2 ⌋ 。作为应用,获得了长度为 ps 超过 F pm 的所有 MDS b 符号恒环码。
更新日期:2020-04-01
down
wechat
bug