Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 52 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 13 tok/s Pro
GPT-4o 100 tok/s Pro
Kimi K2 192 tok/s Pro
GPT OSS 120B 454 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Weight distributions of cyclic codes with respect to pairwise coprime order elements (1306.5809v2)

Published 24 Jun 2013 in cs.IT and math.IT

Abstract: Let $\Bbb F_r$ be an extension of a finite field $\Bbb F_q$ with $r=qm$. Let each $g_i$ be of order $n_i$ in $\Bbb F_r*$ and $\gcd(n_i, n_j)=1$ for $1\leq i \neq j \leq u$. We define a cyclic code over $\Bbb F_q$ by $$\mathcal C_{(q, m, n_1,n_2, ..., n_u)}={c(a_1, a_2, ..., a_u) : a_1, a_2, ..., a_u \in \Bbb F_r},$$ where $$c(a_1, a_2, ..., a_u)=({Tr}{r/q}(\sum{i=1}ua_ig_i0),..., {Tr}{r/q}(\sum{i=1}ua_ig_i{n-1}))$$ and $n=n_1n_2... n_u$. In this paper, we present a method to compute the weights of $\mathcal C_{(q, m, n_1,n_2, ..., n_u)}$. Further, we determine the weight distributions of the cyclic codes $\mathcal C_{(q, m, n_1,n_2)}$ and $\mathcal C_{(q, m, n_1,n_2,1)}$.

Citations (111)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Summary

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

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

Follow-Up Questions

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