Abstract
Let f(u) be a polynomial of degree m, m ≥ 2, which splits into distinct linear factors over a finite field 𝔽q. Let 𝓡 = 𝔽q[u] / ⟨ f(u) ⟩ be a finite non-chain ring. In this paper, we study duadic codes, their extensions and triadic codes over the ring 𝓡. A Gray map from 𝓡n to (𝔽q m)n is defined which preserves self-duality of linear codes. As a consequence, self-dual, isodual, self-orthogonal and complementary dual(LCD) codes over 𝔽 q are constructed. Some examples are also given to illustrate this.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Information and Coding Theory
Disclaimer: 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.
