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

被引：0
|
作者：
Nikolaev, S. [1 ]
Romanov, O. [1 ]
Nyshchuk, A. [1 ]
机构：
[1] Def Intelligence Res Inst, Kiev, Ukraine
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 2023年 / 59卷 / 03期
关键词：
bitstream; time-frequency matrix; Gray code; undirected graph;
D O I：
10.1007/s10559-023-00570-6
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：359 / 364
页数：6
相关论文
共 19 条
  • [1] Method of Modified Depth-First Search in a Graph for Constructing All Possible Gray Codes of a Specified Length
    S. Nikolaev
    O. Romanov
    A. Nyshchuk
    Cybernetics and Systems Analysis, 2023, 59 : 359 - 364
  • [2] An efficient method for constructing a distributed depth-first search tree
    Makki, SAM
    Havas, G
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 660 - 666
  • [3] Depth-first method for attack graph generation
    Information Security Research Center, Harbin Engineering University, Harbin 150001, China
    不详
    Jilin Daxue Xuebao (Gongxueban), 2009, 2 (446-452):
  • [4] Depth-First Search Algorithms for Finding a Generalized Moore Graph
    Satotani, Yoshiki
    Takahashi, Norikazu
    PROCEEDINGS OF TENCON 2018 - 2018 IEEE REGION 10 CONFERENCE, 2018, : 0832 - 0837
  • [5] Recognizing unordered depth-first search trees of an undirected graph in parallel
    Peng, CH
    Wang, BF
    Wang, JS
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2000, 11 (06) : 559 - 570
  • [6] Constructing a Complete Set of Homodesmic Reactions Using the Depth-First Search Procedure
    Khursan, S. L.
    Ismagilova, A. S.
    Ziganshina, F. T.
    Akhmet'yanova, A. I.
    RUSSIAN JOURNAL OF PHYSICAL CHEMISTRY A, 2021, 95 (07) : 1386 - 1393
  • [7] Constructing a Complete Set of Homodesmic Reactions Using the Depth-First Search Procedure
    S. L. Khursan
    A. S. Ismagilova
    F. T. Ziganshina
    A. I. Akhmet’yanova
    Russian Journal of Physical Chemistry A, 2021, 95 : 1386 - 1393
  • [8] MODIFIED DEPTH-FIRST SEARCH FOR THE AUTOMATED DESIGN OF RNAV APPROACH PROCEDURES
    Stauffer, David
    Barnes, W. Justin
    Smith, Leland
    2020 INTEGRATED COMMUNICATIONS NAVIGATION AND SURVEILLANCE CONFERENCE (ICNS), 2020,
  • [9] An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
    Yinrun Lyu
    Li Chen
    Changyou Zhang
    Dacheng Qu
    Nasro Min-Allah
    Yongji Wang
    Journal of Global Optimization, 2018, 70 : 737 - 756
  • [10] Positioning Mine Ventilation Recirculation Winds Based on the Depth-First Search Method
    An Huaming
    Lin Bin
    Lv Lixing
    INTERNATIONAL CONFERENCE ON ADVANCES IN ENGINEERING 2011, 2011, 24 : 400 - 403
12