Constacyclic codes over the integers modulo p^k+1

MaRDI QIDQ5319368zbMATH OpenFDO

Authors Qianqian Feng, Hongwei Liu

Publication date 22 July 2009

zbMATH Keywords

constacyclic codedual codeideallinear code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Recommendations

• Constacyclic codes over the ring F_p+vF_p+v^2F_p
• Constacyclic codes over \(F_p+vF_p\).
• Some constacyclic codes of length \(2^e\) over \(Z_{2^{k+1}}\)
• A class of constacyclic codes over the ring \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+\dotsb +u^{k-1}\mathbb{F}_{p^m}\)
• On the structure of constacyclic codes of length \(p^s\) over \(\mathbb F_{p^k}+u \mathbb F_{p^k}+\cdots+u^{m-1}\mathbb F_{p^k}\)

Cited in

(4)

• Constacyclic codes over R_k
• Some constacyclic codes of length \(2^e\) over \(Z_{2^{k+1}}\)
• Variable-length integer codes based on the Goldbach conjecture, and other additive codes
• A class of constacyclic codes over \(\mathbb Z_{p^m}\)

This page was built for publication: Constacyclic codes over the integers modulo \(p^{k+1}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5319368)