scientific article; zbMATH DE number 2154107

MaRDI QIDQ4664656zbMATH OpenFDO

Authors Galina T. Bogdanova, Stoyan Kapralov

Publication date 8 April 2005

zbMATH Keywords

\(q\)-ary Gray codesweight spectra

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Review text

An algorithm for generating a \(q\)-ary Gray code is presented. The question of ordering all \(q\)-ary vectors with the last nonzero coordinate equal to 1 is solved. An algorithm for computing the transition sequence is given. These investigations are useful for computing the weight spectra of linear codes. An algorithm for finding the spectrum of a \(q\)-ary linear code over \(\text{GF}(q)\) is described in the appendix. For the entire collection see [Zbl 0944.00096].

Recommendations

• \(q\)-ary Gray codes and weight distributions
• On m-ary Gray codes
• scientific article; zbMATH DE number 4139306
• Linear time construction of a compressed Gray code
• Gray codes and overlap cycles for restricted weight words

Cited in

(8)

• A method for efficiently computing the number of codewords of fixed weights in linear codes
• \(q\)-ary Gray codes and weight distributions
• On the \(q\)-analog of the revolving door algorithm
• scientific article; zbMATH DE number 1396785 (Why is no real title available?)
• scientific article; zbMATH DE number 3895073 (Why is no real title available?)
• Method of modified depth-first search in a graph for constructing all possible Gray codes of a specified length
• scientific article; zbMATH DE number 7684688 (Why is no real title available?)
• Gray code orders for \(q\)-ary words avoiding a given factor

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4664656)