होम
एक्सप्लोर
nav.journalClub
ट्रेंडिंग
और
synapse
⌘+K
भाषा
हिन्दी
Recursive construction and enumeration of self-orthogonal and self-dual codes over finite commutative chain rings of even characteristic | Synapse
March 3, 2026
Recursive construction and enumeration of self-orthogonal and self-dual codes over finite commutative chain rings of even characteristic
MY
Mahipal Yadav
Sarojini Naidu Medical College
AS
Anuradha Sharma
Key Points
Self-orthogonal codes are generated recursively, providing a structured approach to their construction.
Enumeration of codes reveals specific properties of self-dual codes, highlighting their significance in coding theory.
The study involves finite commutative chain rings, specifically focusing on their even characteristic for code analysis.
This work suggests that new construction methods could enhance error correction in digital communications.
Mark Helpful
Like
Save
Bookmark
Relay
Share
Mark Helpful
Like
Save
Bookmark
Relay
Share
Cite This Study
Copy
Yadav et al. (Sun,) studied this question.
synapsesocial.com/papers/69a767e4badf0bb9e87e2c7f
https://doi.org/https://doi.org/10.1007/s10623-026-01804-2