.png){kind=icon}
.png){kind=icon}
Return
Secreted graphs to binary codes and applications
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-022-06948-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The purpose of this paper is to introduce a novel notion of hypergraph-based codes, L.C-hypergraphs and codeable hypergraphs with respect to binary (linear) codes. In order to realize the article's goals, we define the concepts of code-based graphs, consider them as complex networks and construct them from binary (linear) codes via an equivalence relation on (L.C-hypergraphs) codeable hypergraphs. The paper includes implications for the development of fuzzy graph and for modeling the security problems by codeable hypergraphs and applications in complex hypernetworks. The new conception of codeable hypergraphs was given for the first time in this paper. Finally (L.C-hypergraphs), codeable hypergraphs, as complex hypernetworks, are applied as a tool in wireless sensor hypernetworks, code-based graphs, in wireless sensor networks and the bilateral relations between them.
Keywords:
Binary (linear) codes
(Hyper) graph
Codeable hypergraphs
Positive equivalence relation L
C-hypergraphs
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W