Table of Contents
Fetching ...

Quadratic Residue Codes over $\mathbb{Z}_{121}$

Tapas Chatterjee, Priya Jain

Abstract

In this paper, we construct a special family of cyclic codes, known as quadratic residue codes of prime length \( p \equiv \pm 1 \pmod{44} ,\) \( p \equiv \pm 5 \pmod{44} ,\) \( p \equiv \pm 7 \pmod{44} ,\) \( p \equiv \pm 9 \pmod{44} \) and \( p \equiv \pm 19 \pmod{44} \) over $\mathbb{Z}_{121}$ by defining them using their generating idempotents. Furthermore, the properties of these codes and extended quadratic residue codes over $\mathbb{Z}_{121}$ are discussed, followed by their Gray images. Also, we show that the extended quadratic residue code over $\mathbb{Z}_{121}$ possesses a large permutation automorphism group generated by shifts, multipliers, and inversion, making permutation decoding feasible. As examples, we construct new codes with parameters $[55,5,33]$ and $[77,7,44].$

Quadratic Residue Codes over $\mathbb{Z}_{121}$

Abstract

In this paper, we construct a special family of cyclic codes, known as quadratic residue codes of prime length and over by defining them using their generating idempotents. Furthermore, the properties of these codes and extended quadratic residue codes over are discussed, followed by their Gray images. Also, we show that the extended quadratic residue code over possesses a large permutation automorphism group generated by shifts, multipliers, and inversion, making permutation decoding feasible. As examples, we construct new codes with parameters and

Paper Structure

This paper contains 10 sections, 41 theorems, 59 equations.

Key Result

Theorem 2.4

The Legendre symbol $\left(\frac{11}{p}\right)=1$ if and only if

Theorems & Definitions (70)

  • Definition 2.1
  • Definition 2.2
  • Definition 2.3
  • Theorem 2.4
  • proof
  • Lemma 2.5
  • proof
  • Lemma 2.6
  • proof
  • Theorem 2.7
  • ...and 60 more