On a class of constacyclic codes of length 4ps over ð ½pm + uð ½pm
© 2019 World Scientific Publishing Company Let (Formula presented.) be a prime such that (Formula presented.) (mod 4). For any unit (Formula presented.) of (Formula presented.), we determine the algebraic structures of (Formula presented.)-constacyclic codes of length (Formula presented.) over the f...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | 雜誌 |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85044442291&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/58816 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | © 2019 World Scientific Publishing Company Let (Formula presented.) be a prime such that (Formula presented.) (mod 4). For any unit (Formula presented.) of (Formula presented.), we determine the algebraic structures of (Formula presented.)-constacyclic codes of length (Formula presented.) over the finite commutative chain ring (Formula presented.), (Formula presented.). If the unit (Formula presented.) is a square, each (Formula presented.)-constacyclic code of length (Formula presented.) is expressed as a direct sum of an -(Formula presented.)-constacyclic code and an (Formula presented.)-constacyclic code of length (Formula presented.) If the unit (Formula presented.) is not a square, then (Formula presented.) can be decomposed into a product of two irreducible coprime quadratic polynomials which are (Formula presented.) and (Formula presented.), where (Formula presented.) and (Formula presented.). By showing that the quotient rings (Formula presented.) and (Formula presented.) are local, non-chain rings, we can compute the number of codewords in each of (Formula presented.)-constacyclic codes. Moreover, the duals of such codes are also given. |
|---|