Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Duadic negacyclic codes over a finite non-chain ring and their Gray images (1805.09678v1)

Published 23 May 2018 in cs.IT and math.IT

Abstract: Let $f(u)$ be a polynomial of degree $m, m \geq 2,$ which splits into distinct linear factors over a finite field $\mathbb{F}{q}$. Let $\mathcal{R}=\mathbb{F}{q}[u]/\langle f(u)\rangle$ be a finite non-chain ring. In an earlier paper, we studied duadic and triadic codes over $\mathcal{R}$ and their Gray images. Here, we study duadic negacyclic codes of Type I and Type II over the ring $\mathcal{R}$, their extensions and their Gray images. As a consequence some self-dual, isodual, self-orthogonal and complementary dual(LCD) codes over $\mathbb{F}_q$ are constructed. Some examples are also given to illustrate this.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Mokshi Goyal (5 papers)
  2. Madhu Raka (15 papers)
Citations (4)

Summary

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