Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Quadratic residue code

Known as: Gleason-Prange theorem, Gleason–Prange theorem 
A quadratic residue code is a type of cyclic code. There is a quadratic residue code of length over the finite field whenever and are primes, is odd… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block… Expand
2009
2009
This paper used an efficient scheme to determine the number of codewords for a given weight in the binary extended quadratic… Expand
Highly Cited
2008
Highly Cited
2008
Recently, an algebraic decoding algorithm suggested by Truong (2005) for some quadratic residue codes with irreducible generating… Expand
  • table I
  • figure 1
  • figure 2
2008
2008
A new effective lookup table for decoding the binary systematic (41, 21, 9) quadratic residue (QR) code up to 4 errors is… Expand
  • table 1
  • table 2
  • figure 1
2003
2003
self-dual doubly-even code into three cases. A previous search assuming one of the cases found only the Extended Quadratic… Expand
2002
2002
We investigate the weight structure and error-correcting performance of the ternary [13, 7, 5] quadratic-residue code. It is… Expand
Highly Cited
2001
Highly Cited
2001
The techniques needed to decode the (47,24,11) quadratic residue (QR) code differ from the schemes developed for cyclic codes. By… Expand
Highly Cited
1995
Highly Cited
1995
We construct new self-dual and isodual codes over the integers module 4. The binary images of these codes under the Gray map are… Expand
Highly Cited
1990
Highly Cited
1990
An algebraic decoding algorithm for the 1/2-rate (32, 16, 8) quadratic residue (QR) code is found. The key idea of this algorithm… Expand
Highly Cited
1972
Highly Cited
1972
In this paper we present the weight distribution of all 2^26 cosets of the (32,6) first-order Reed-Muller code. The code is… Expand
  • table I
  • table II
  • table III
  • table IV
  • table VI