On the Classification of Codes over Non-Unital Ring of Order 4

Authors Sourav Deb, Isha Kikani, M. K. Gupta

Publication date 18 August 2022

Abstract: In the last 60 years coding theory has been studied a lot over finite fields

m a t h b b F_{q}

or commutative rings

m a t h c a l R

with unity. Although in

1993

, a study on the classification of the rings (not necessarily commutative or ring with unity) of order

p^{2}

had been presented, the construction of codes over non-commutative rings or non-commutative non-unital rings surfaced merely two years ago. In this letter, we extend the diverse research on exploring the codes over the non-commutative and non-unital ring

E = l a n g l e 2 a = 2 b = 0, a^{2} = a, b^{2} = b, a b = a, b a = b a n g l e

by presenting the classification of optimal and nice codes of length

n l e q 7

over

E

, along-with respective weight enumerators and complete weight enumerators.

This page was built for publication: On the Classification of Codes over Non-Unital Ring of Order 4

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