q-ary Gray codes and weight distributions
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2154107
- Identities and approximations for the weight distribution of q-ary codes
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- scientific article; zbMATH DE number 7332482
- Characteristic vector and weight distribution of a linear code
Cites work
- A Readily Implemented Single-Error-Correcting Unit-Distance Counting Code
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- On m-ary Gray codes
- On Generating the N-ary Reflected Gray Codes
- Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
- The generation of rimitive olynomials in GF(q) with independent roots and their applications for ower residue codes, VLSI testing and finite field multipliers using normal basis
- Weight distribution of some 'best'<tex>(3m,2m)</tex>binary quasi-cyclic codes (Corresp.)
Cited in
(6)- A method for efficiently computing the number of codewords of fixed weights in linear codes
- Characteristic vector and weight distribution of a linear code
- Index system and separability of constant weight Gray codes
- scientific article; zbMATH DE number 2154107 (Why is no real title available?)
- The homogeneous weight for Rk, related gray map and new binary quasi-cyclic codes
- Algorithm 1059: LinCodeWeightInv -- library for computing the weight distribution of linear codes over finite fields
This page was built for publication: \(q\)-ary Gray codes and weight distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294219)