A class of linear codes of length 2 over finite chain rings
© 2020 World Scientific Publishing Company. Let pm be a finite field of cardinality pm, where p is an odd prime, k,λ be positive integers satisfying λ ≥ 2, and denote = pm[x]/(f(x)λpk), where f(x) is an irreducible polynomial in pm[x]. In this note, for any fixed invertible element ω ×, we present a...
Saved in:
Main Authors: | Yonglin Cao, Yuan Cao, Hai Q. Dinh, Fang Wei Fu, Jian Gao, Songsak Sriboonchitta |
---|---|
Format: | Journal |
Published: |
2019
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85070193939&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/66706 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
Repeated-root constacyclic codes of prime power lengths over finite chain rings
by: Hai Q. Dinh, et al.
Published: (2018) -
Repeated-root constacyclic codes of prime power lengths over finite chain rings
by: Hai Q. Dinh, et al.
Published: (2018) -
Skew Constacyclic Codes over Finite Fields and Finite Chain Rings
by: Hai Q. Dinh, et al.
Published: (2018) -
Skew Constacyclic Codes over Finite Fields and Finite Chain Rings
by: Hai Q. Dinh, et al.
Published: (2018) -
Repeated-root constacyclic codes of prime power lengths over finite chain rings
by: Dinh H., et al.
Published: (2017)