Structure of linear codes over the ring $B_k$
Irwansyah, Djoko Suprijanto

TL;DR
This paper investigates the structure of linear codes over the ring B_k, exploring their properties, dualities, bounds, and classifications, and establishing connections with codes over finite fields through Gray maps.
Contribution
It provides a detailed structural analysis of codes over B_k, including self-duality, cyclicity, and generator characterization, extending coding theory over finite rings.
Findings
Characterization of Euclidean and Hermitian self-dual codes over B_k
Derivation of MacWilliams relations and Singleton bounds for these codes
Explicit description of cyclic and quasi-cyclic codes and their generators
Abstract
We study the structure of linear codes over the ring which is defined by In order to study the codes, we begin with studying the structure of the ring via a Gray map which also induces a relation between codes over and codes over We consider Euclidean and Hermitian self-dual codes, MacWilliams relations, as well as Singleton-type bounds for these codes. Further, we characterize cyclic and quasi-cyclic codes using their images under the Gray map, and give the generators for these type of codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
