✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
By defining and making use of a distance-preserving Gray map, we get a family of optimal one-Hamming weight codes over finite fields.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In this study, we obtain one-Lee weight codes over a class of nonchain rings and study their structures.
📊
Key Findings & Data:We give an explicit construction for one-Lee weight codes.
💡
Conclusion & Impact:By defining and making use of a distance-preserving Gray map, we get a family of optimal one-Hamming weight codes over finite fields.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Linear codes · one-Lee weight codes · gray map
Abstract
In this study, we obtain one-Lee weight codes over a class of nonchain rings and study their structures. We give an explicit construction for one-Lee weight codes. A method to derive more one-Lee weight codes from given a one-Lee weight code is also represented. By defining and making use of a distance-preserving Gray map, we get a family of optimal one-Hamming weight codes over finite fields.
🔖
Cite This Article
Sarı, M. (2023). One Weight Codes Over the Ring $F_q[v]/(v^s-1)$. Journal of Engineering Technology and Applied Sciences, Cilt: 8 Sayı: 1, 35–47. https://doi.org/10.30931/jetas.1152408