Repeated-root constacyclic codes of length $2p^s$ over Galois rings
From MaRDI portal
Publication:4968624
DOI10.4134/BKMS.B180148zbMath1411.94105OpenAlexW2963490381MaRDI QIDQ4968624
Wateekorn Sriwirach, Chakkrid Klin-eam
Publication date: 16 July 2019
Full work available at URL: https://www.kci.go.kr/kciportal/ci/sereArticleSearch/ciSereArtiView.kci?sereArticleSearchBean.artiId=ART002434289
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On structure and distances of some classes of repeated-root constacyclic codes over Galois rings
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Codes for the \(m\)-metric
- The automorphism group of a linear space with the Rosenbloom-Tsfasman metric
- Matrix product codes with Rosenbloom-Tsfasman metric
- On linear codes with large weights simultaneously for the Rosenbloom-Tsfasman and Hamming metrics
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- Cyclic codes over \(\mathbb Z_4\) of even length
- Kerdock code in a cyclic form
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Semisimple cyclic and Abelian codes. II
- A linear construction for certain Kerdock and Preparata codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- A note on the q-ary image of a q/sup m/-ary repeated-root cyclic code
- Fundamentals of Error-Correcting Codes
- Negacyclic and cyclic codes over Z/sub 4/
- Some Repeated-Root Constacyclic Codes Over Galois Rings
- Negacyclic codes over Z/sub 4/ of even length
- Weight distributions of cyclic self-dual codes
- On repeated-root cyclic codes
- Repeated-root cyclic codes
This page was built for publication: Repeated-root constacyclic codes of length $2p^s$ over Galois rings
