Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
GPT-5.1
GPT-5.1 30 tok/s
Gemini 3.0 Pro 42 tok/s
Gemini 2.5 Flash 130 tok/s Pro
Kimi K2 200 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

On a class of left metacyclic codes (1606.05019v1)

Published 16 Jun 2016 in cs.IT and math.IT

Abstract: Let $G_{(m,3,r)}=\langle x,y\mid xm=1, y3=1,yx=xry\rangle$ be a metacyclic group of order $3m$, where ${\rm gcd}(m,r)=1$, $1<r<m$ and $r3\equiv 1$ (mod $m$). Then left ideals of the group algebra $\mathbb{F}q[G{(m,3,r)}]$ are called left metacyclic codes over $\mathbb{F}q$ of length $3m$, and abbreviated as left $G{(m,3,r)}$-codes. A system theory for left $G_{(m,3,r)}$-codes is developed for the case of ${\rm gcd}(m,q)=1$ and $r\equiv q\epsilon$ for some positive integer $\epsilon$, only using finite field theory and basic theory of cyclic codes and skew cyclic codes. The fact that any left $G_{(m,3,r)}$-code is a direct sum of concatenated codes with inner codes ${\cal A}i$ and outer codes $C_i$ is proved, where ${\cal A}_i$ is a minimal cyclic code over $\mathbb{F}_q$ of length $m$ and $C_i$ is a skew cyclic code of length $3$ over an extension field of $\mathbb{F}_q$. Then an explicit expression for each outer code in any concatenated code is provided. Moreover, the dual code of each left $G{(m,3,r)}$-code is given and self-orthogonal left $G_{(m,3,r)}$-codes are determined.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.