\(q\)-ary Gray codes and weight distributions
From MaRDI portal
Publication:1294219
DOI10.1016/S0096-3003(98)10050-4zbMath0933.94034MaRDI QIDQ1294219
T. Aaron Gulliver, Jack M. Stein, Vijay K. Bhargava
Publication date: 9 April 2000
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0096-3003(98)10050-4
94B05: Linear codes (general theory)
Related Items
A method for efficiently computing the number of codewords of fixed weights in linear codes, Characteristic vector and weight distribution of a linear code
Cites Work
- Unnamed Item
- Unnamed Item
- On \(m\)-ary Gray codes
- On Generating the N-ary Reflected Gray Codes
- 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
- Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
- Weight distribution of some 'best'<tex>(3m,2m)</tex>binary quasi-cyclic codes (Corresp.)
- A Readily Implemented Single-Error-Correcting Unit-Distance Counting Code