Negacyclic codes of odd length over the ring mathbbF_p[u,v]/\⟨\n u²,v²,uv-vu\⟩

2015/01/29 by Bappaditya Ghosh, Ghosh, Bappaditya
Computer Science · Engineering · Mathematics · #94B15 #Coding theory and cryptography #FOS: Computer and information sciences #Finite Group Theory Research #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1501.07431

openalex publication_date 2015/01/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We discuss the structure of negacyclic codes of odd length over the ring\n mathbbF_p[u, v]/ \⟨ u², v², uv-vu \⟩. We find the unique\ngenerating set, the rank and the minimum distance for these negacyclic codes.\n

Citations

• Cyclic codes over the ring \Z_p[u, v]/⟨ u², v², uv-vu⟩

Related

• Negacyclic codes over Z4+uZ4
• Cyclic codes over the ring \mathbbF_p[u,v] / ⟨ u^k,v²,uv-vu⟩
• Cyclic codes over the ring \Z_p[u, v]/⟨ u², v², uv-vu⟩
• An explicit representation and enumeration for negacyclic codes of length 2^kn over ℤ₄+uℤ₄
• Cyclic codes over the ring \mathbbF_p[u,v,w]/⟨ u², v², w², uv-vu, vw-wv, uw-wu ⟩