Linear Codes over the Ring Z4+uZ4+vZ4+wZ4+uvZ4+uwZ4+vwZ4+uvwZ4

Bustomi, Aditya Purwa Santika, Djoko Suprijanto

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

We investigate linear codes over the ring (Formula presented), with conditions u2 = u, v 2 = v, w2 = w, uv = vu, uw = wu and vw = wv. We first analyze the structure of the ring and then define linear codes over this ring. The Lee weight and the Gray map for these codes are defined and MacWilliams relations for complete, symmetrized, and Lee weight enumerators are derived. The Singleton bound as well as maximum distance separable codes are also considered. Furthermore, cyclic and quasi-cyclic codes are discussed, and as an application some new linear codes over Z4 with the highest known minimum Lee distance are also obtained.

Original languageEnglish
Pages (from-to)1-11
Number of pages11
JournalIAENG International Journal of Computer Science
Volume48
Issue number3
Publication statusPublished - 2021

Keywords

  • Cyclic codes
  • Linear codes
  • MacWilliams relations
  • Maximum distance separable codes
  • Quasi-cyclic codes
  • optimal codes

Fingerprint

Dive into the research topics of 'Linear Codes over the Ring Z4+uZ4+vZ4+wZ4+uvZ4+uwZ4+vwZ4+uvwZ4'. Together they form a unique fingerprint.

Cite this