✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
The codewords of such perfect codes are generated by the elements of a subgroup of the considered group.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In this paper, a new family of t−error correcting perfect codes over Hurwitz integers is presented.
📊
Key Findings & Data:To obtain these perfect codes, the perfect t−dominating sets over the circulant graphs are used.
💡
Conclusion & Impact:The codewords of such perfect codes are generated by the elements of a subgroup of the considered group.
🔬Design:Araştırma Makalesi
📍Scope:Comprehensive Sample
⚙️Variables:Circulant graphs · Hurwitz integers · perfect codes
Abstract
In this paper, a new family of t−error correcting perfect codes over Hurwitz integers is presented. To obtain these perfect codes, the perfect t−dominating sets over the circulant graphs are used. The codewords of such perfect codes are generated by the elements of a subgroup of the considered group.
Keywords
🔖
Cite This Article
Güzeltepe, M., Güner, G. (2022). PERFECT CODES OVER HURWITZ INTEGERS INDUCED BY CIRCULANT GRAPHS. Journal of Universal Mathematics, Cilt: 5 Sayı: 1, 24–35. https://doi.org/10.33773/jum.985160