Method of modified depth-first search in a graph for constructing all possible Gray codes of a specified length

DOI10.1007/S10559-023-00570-6MaRDI QIDQ6115821

No author found.

Publication date: 13 July 2023

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

undirected graphGray codebitstreamtime-frequency matrix

Mathematics Subject Classification ID

Combinatorial codes (94B25) Graph theory (05Cxx)

Cites Work

• Method for recognition of parameters of error-correcting block-cyclic codes by a generator polynomial
• Efficient generation of the binary reflected gray code and its applications
• Efficient Computation of Middle Levels Gray Codes
• A textbook of graph theory

This page was built for publication: Method of modified depth-first search in a graph for constructing all possible Gray codes of a specified length