On minimum weight codewords in QR codes
A linear (n,k,d) code is said to be optimal iff \(d=n-k+1\). Assmus and Mattson have shown that given a prime p, for all but a finite number of primes q each cyclic (p,k) code over \(GF(q^ i)\) is optimal. This paper provides a method for determining these ``exceptional characteristics, and the corresponding minimum weights, for quadratic-residue (QR) codes of modest length. The procedure involves calculations with global QR codes. The analysis reveals that a nonoptimal case requires \(q\leq 2^{- (p-1)/2}[(p+1)/2]^{(p+1)/4}.\) In addition, the method can be used to examine the t-designs derived from the codewords of minimum weight.
- scientific article; zbMATH DE number 3756373 (Why is no real title available?)
- scientific article; zbMATH DE number 3641577 (Why is no real title available?)
- Information sets in quadratic-residue codes
- New 5-designs
- On MDS extensions of generalized Reed- Solomon codes
- On weights in quadratic-residue codes
- Über die Quadratwurzel-Schranke für quadratische-Rest-Codes. (On the square root bound for quadratic-residue codes)
- On the square-root bound for QR-codes
- Quadratic residue codes in their prime
- Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials
- A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
- Optimal codes for minimax criterion on error detection
- scientific article; zbMATH DE number 3930889 (Why is no real title available?)
- On a Sequence of Subcodes of the Quadratic Residue Code for p = 8m + 1
- Construction of quasi-twisted codes and enumeration of defining polynomials
This page was built for publication: On minimum weight codewords in QR codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102257)
