Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On cyclic codes over $\mathbb{Z}_q+u\mathbb{Z}_q$ (1501.03924v4)

Published 16 Jan 2015 in cs.IT and math.IT

Abstract: Let $R=\mathbb{Z}_q+u\mathbb{Z}_q$, where $q=ps$ and $u2=0$. In this paper, some structural properties of cyclic codes over the ring $R$ are considered. A necessary and sufficient condition for cyclic codes over the ring $R$ to be free is obtained and a BCH-type bound on the minimum Hamming distance for them is also given.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Jian Gao (119 papers)
  2. Fang-Wei Fu (80 papers)
  3. Ling Xiao (45 papers)
  4. Rama Krishna Bandi (4 papers)
Citations (1)

Summary

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