Abstract
In the last 60 years coding theory has been studied a lot over finite fields [Formula: see text] or commutative rings [Formula: see text] with unity. Although in [Formula: see text], a study on the classification of the rings (not necessarily commutative or ring with unity) of order [Formula: see text] 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 [Formula: see text] by presenting the classification of optimal and nice codes of length [Formula: see text] over [Formula: see text], along with respective weight enumerators and complete weight enumerators.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
