Method of Modified Depth-First Search in a Graph for Constructing All Possible Gray Codes of a Specified Length.

Autor:	Nikolaev, S., Romanov, O., Nyshchuk, A.
Předmět:	GRAY codes INFORMATION design
Zdroj:	Cybernetics & Systems Analysis; May2023, Vol. 59 Issue 3, p359-364, 6p
Abstrakt:	The problem of searching for possible Gray code variants for interpreting time-frequency matrices used in the design of information transmission channels is considered. An undirected homogeneous incomplete circulant graph of degree 4 has been constructed. A method and algorithm for implementing a modified search in a graph have been proposed, which allows for constructing all Gray codes of a specified length. A formula for calculating the number of variants of these codes has been provided. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu Full text from SpringerLink