m-th residue codes with length the product of two odd primes over finite fields
From MaRDI portal
(Redirected from Publication:5037997)
\(m\)-th residue codes with length the product of two odd primes over finite fields
\(m\)-th residue codes with length the product of two odd primes over finite fields
Recommendations
Cites work
- A performance comparison of the binary quadratic residue codes with the 1/2-rate convolutional codes
- Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
- Double Circulant Quadratic Residue Codes
- Fundamentals of Error-Correcting Codes
- Generalized residue and t-residue codes and their idempotent generators
- Generalizing binary quadratic residue codes to higher power residues over larger fields
- scientific article; zbMATH DE number 3756556 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 7595032 (Why is no real title available?)
- LCD Cyclic Codes Over Finite Fields
- Legendre sums and codes related to QR codes
- On Cyclic Codes of Composite Length and the Minimum Distance
- On the square-root bound for QR-codes
- The minimum distance of the [83,42] ternary quadratic residue code
Cited in
(4)
This page was built for publication: \(m\)-th residue codes with length the product of two odd primes over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5037997)
