Generalizing binary quadratic residue codes to higher power residues over larger fields
The binary quadratic residue codes are well-known codes in coding theory. Their construction starts from \(p\equiv \pm1\pmod{8}\) so that 2 is a quadratic residue modulo \(p\). This article investigates a generalization of these quadratic residue codes. Let \(p\) and \(q\) be two distinct prime numbers such that \(q|(p-1)\) and such that \(q\) is a \(q\)-th power residue modulo \(p\). Then there exists an element \(\beta\in\mathbb{F}_p\) such that \(\beta^q\equiv q \pmod{p}\), and it is possible to divide \(\mathbb{F}_p\) into \(q\) cosets. These cosets are the basis to define the \(q\)-th power residue codes. The author presents generating polynomials for these codes, and defines a new notion corresponding to the binary concept of an idempotent. The construction of these \(q\)-th power residue codes is also briefly explained in Section 15.2 of \textit{E. W. Berlekamp} [Algebraic Coding Theory (McGraw-Hill, New York, NY) (1968; Zbl 0988.94521)]. Using different techniques from the book of Berlekamp, the author presents a lower bound on the codeword weight of the dual of these \(q\)-th power residue codes. This lower bound then leads to a lower bound on the weight of the codewords of the \(q\)-th power residue codes.
- Quadratic residues codes of prime power length over Z₄
- A generalisation of quadratic residue codes to the case of cubic and biquadratic residues
- A class of quadratic residue codes over \(Z_{2^m}\) and their extended codes
- Construction of generator polynomials for residue codes of degrees 5--8
- Z₈-cyclic codes and quadratic residue codes
- Quadratic residue codes over Fp+u Fp+ v Fp+uv Fp+v2 Fp+uv2 Fp
- QUADRATIC RESIDUE CODES OVER p-ADIC INTEGERS AND THEIR PROJECTIONS TO INTEGERS MODULO pe
- Finding an asymptotically bad family of \(q\)-th power residue codes
- scientific article; zbMATH DE number 1792640
- Minimal quadratic residue cyclic codes of length p^n (p odd prime)
- Higher power residue codes.
- Finding an asymptotically bad family of \(q\)-th power residue codes
- Biquadratic residue codes over F₂
- Construction of generator polynomials for residue codes of degrees 5--8
- scientific article; zbMATH DE number 3788531 (Why is no real title available?)
- scientific article; zbMATH DE number 1792640 (Why is no real title available?)
- \(m\)-th residue codes with length the product of two odd primes over finite fields
- scientific article; zbMATH DE number 7595032 (Why is no real title available?)
- A generalisation of quadratic residue codes to the case of cubic and biquadratic residues
- Bound on the minimum distance of double circulant cubic residue codes
- Double circulant codes from cubic cyclotomy
This page was built for publication: Generalizing binary quadratic residue codes to higher power residues over larger fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017424)
