AN IDENTITY BETWEEN THE m-SPOTTY ROSENBLOOM-TSFASMAN WEIGHT ENUMERATORS OVER FINITE COMMUTATIVE FROBENIUS RINGS

Özen, Mehmet; Shi, Minjia; Şiap, Vedat

doi:10.4134/bkms.2015.52.3.809

Search citation statements

Order By: Relevance

Paper Sections

Select...

Preliminary1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

2022

Publication Types

Select...

Article3

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 18 publications

(15 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If the nonzero weight is N , the code is called a one-weight Z 2 R 2 additive code with weight N . Similar to the discussion in Refs [16,18], we have the following result.…”

Section: Preliminarymentioning

confidence: 99%

One and Two‐Weight ℤ ₂ R ₂ Additive Codes

Tiantian

Shi

Lin

et al. 2021

Chinese J of Electronics

View full text Add to dashboard Cite

This paper is devoted to the construction of one and two‐weight Z2R2 additive codes, where R2=F2[v]/〈v4〉. It is a generalization towards another direction of Z2Z4 codes (S.T. Dougherty, H.W. Liu and L. Yu, “One weight Z2Z4 additive codes”, Applicable Algebra in Engineering, Communication and Computing, Vol.27, No.2, pp.123‐138, 2016). A MacWilliams identity which connects the weight enumerator of an additive code over Z2R2 and its dual is established. Several construction methods of one‐weight and two‐weight additive codes over Z2R2 are presented. Several examples are presented to illustrate our main results and some open problems are also proposed.

show abstract

“…If the nonzero weight is N , the code is called a one-weight Z 2 R 2 additive code with weight N . Similar to the discussion in Refs [16,18], we have the following result.…”

Section: Preliminarymentioning

confidence: 99%