Symbol-Pair Distances of Repeated-Root Negacyclic Codes of Length 2s over Galois Rings

来源 :代数集刊(英文版) | 被引量 : 0次 | 上传用户:zhoujans
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
Negacyclic codes of length 2s over the Galois ring GR(2a,m) are linearly ordered under set-theoretic inclusion,i.e.,they are the ideals ,0 ≤ i ≤ 2sa,of the chain ring GR(2a,m)[x]/.This structure is used to obtain the symbol-pair distances of all such negacyclic codes.Among others,for the special case when the alphabet is the finite field F2m (i.e.,a =1),the symbol-pair distance distribution of constacyclic codes over F2m verifies the Singleton bound for such symbol-pair codes,and provides all maximum distance separable symbol-pair constacyclic codes of length 2s over F2m.
其他文献
We consider the inverse problem of identifying a general source term,which is a function of both time variable and the spatial variable,in a parabolic PDE from the knowledge of boundary measurements of the solution on some portion of the lateral boundary.
In the present paper we study the well-posedness using the Galerkin method and the stabilization considering multiplier techniques for a fourth-order nonlinear Schr(o)dinger equation in domains with moving boundaries.We consider two situa-tions for the st
Let (W,S) be the affine Weyl group of type (B)2,on which we consider the length function e from W to N and the Bruhat order ≤.For y < w in W,let μ(y,w) be the coefficient of q1/2(e(w)-e(y)-1) in Kazhdan-Lusztig polynomial Py,w ∈ Z[q].We determine some μ(y
Let G be an extension of a finite characteristically simple group by an abelian group or a finite simple group.It is shown that every Coleman automorphism of G is an inner automorphism.Interest in such automorphisms arises from the study of the normalizer
We study the relations between two groups related to cluster automorphism groups which are defined by Assem,Schiffler and Shamchenko.We establish the relation-ships among (strict) direct cluster automorphism groups and those groups consisting of periodici
Reed-Solomon codes are widely used to establish a reliable channel to transmit information in digital communication which has a strong error correction capability and a variety of efficient decoding algorithm.Usually we use the maximum likelihood decoding
Arylalkylamine N-acetyltransferase (aaNAT) catalyzes the acetylation of dopamine,5-hydroxy-tryptamine,tryptamine,octopamine,norepinephrine and other ary-lalkylamines to form respective N-acetyl-arylalkylamines.Depending on the products formed,aaNATs are i
Let R be an associative unital ring and not necessarily commutative.We analyze conditions under which every n × n matrix A over R is expressible as a sum A =E1 +…+ Es + N of (commuting) idempotent matrices Ei and a nilpotent matrix N.
For a group G,we produce upper and lower bounds for the sum of the entries of the Brauer character table of G and the projective indecomposable character table of G.When G is a π-separable group,we show that the sum of the entries in the table of Isaacs\
The phenylpyrazole insecticide fipronil blocks resistance to dieldrin (RDL)γ-aminobutyric acid (GABA) receptors in insects,thereby impairing inhibitory neuro-transmission.Some insect species,such as the diamondback moth (Plutella xylostella),possess more