AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.8 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Cyclic codes over F 2 [ u , v , w ] / u 2 = v 2 , u v = 0 , w 2 = w and its applications

Department of Basic Sciences, Faculty of Engineering and Architecture, Altınbaş University, 34218, Mahmutbey, İstanbul, Türkiye
Show Author Information

Abstract

We investigate linear and cyclic codes over the ring F 2 [ u , v , w ] / u 2 = v 2 , u v = 0 , w 2 = w . This is a commutative Frobenius non-chain ring, which, to the best of our knowledge, is studied here for the first time in the literature. We define a homogeneous weight on the ring and, with respect to a Gray map induced by this weight, obtain the optimal Reed-Muller code R M ( 1 , 7 ). We analyze the algebraic structure of the ring in detail, determine its ideals, and present code constructions together with their Gray images.

CLC number: 11T71, 95B15

References

【1】
【1】
 
 
AIMS Mathematics
Pages 28396-28406

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
BULUT YILGÖR M. Cyclic codes over F 2 [ u , v , w ] / u 2 = v 2 , u v = 0 , w 2 = w and its applications. AIMS Mathematics, 2025, 10(12): 28396-28406. https://doi.org/10.3934/math.20251249

118

Views

1

Downloads

1

Crossref

0

Web of Science

0

Scopus

Received: 07 October 2025
Revised: 26 November 2025
Accepted: 27 November 2025
Published: 03 December 2025
©2025 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)