Bibliografias temáticas / Graphe de code / Artigos de revistas
Siga este link para ver outros tipos de publicações sobre o tema: Graphe de code.

Artigos de revistas sobre o tema "Graphe de code"

Autor: Grafiati
Publicado: 15 de fevereiro de 2025

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Veja os 50 melhores artigos de revistas para estudos sobre o assunto "Graphe de code".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Veja os artigos de revistas das mais diversas áreas científicas e compile uma bibliografia correta.

1

Azkarate, Igor, Mikel Ayani, Juan Carlos Mugarza, and Luka Eciolaza. "Petri Net-Based Semi-Compiled Code Generation for Programmable Logic Controllers." Applied Sciences 11, no. 15 (2021): 7161. http://dx.doi.org/10.3390/app11157161.

Texto completo da fonte
Resumo:
Industrial discrete event dynamic systems (DEDSs) are commonly modeled by means of Petri nets (PNs). PNs have the capability to model behaviors such as concurrency, synchronization, and resource sharing, compared to a step transition function chart or GRAphe Fonctionnel de Commande Etape Transition (GRAFCET) which is a particular case of a PN. However, there is not an effective systematic way to implement a PN in a programmable logic controller (PLC), and so the implementation of such a controller outside a PLC in some external software that will communicate with the PLC is very common. There
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

MÜLLER, T., and J. S. SERENI. "Identifying and Locating–Dominating Codes in (Random) Geometric Networks." Combinatorics, Probability and Computing 18, no. 6 (2009): 925–52. http://dx.doi.org/10.1017/s0963548309990344.

Texto completo da fonte
Resumo:
We model a problem about networks built from wireless devices using identifying and locating–dominating codes in unit disk graphs. It is known that minimizing the size of an identifying code is -complete even for bipartite graphs. First, we improve this result by showing that the problem remains -complete for bipartite planar unit disk graphs. Then, we address the question of the existence of an identifying code for random unit disk graphs. We derive the probability that there exists an identifying code as a function of the radius of the disks, and we find that for all interesting ranges of r
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Hudry, Olivier, Junnila Ville, and Antoine Lobstein. "On Iiro Honkala’s Contributions to Identifying Codes." Fundamenta Informaticae 191, no. 3-4 (2024): 165–96. http://dx.doi.org/10.3233/fi-242178.

Texto completo da fonte
Resumo:
A set C of vertices in a graph G = (V, E) is an identifying code if it is dominating and any two vertices of V are dominated by distinct sets of codewords. This paper presents a survey of Iiro Honkala’s contributions to the study of identifying codes with respect to several aspects: complexity of computing an identifying code, combinatorics in binary Hamming spaces, infinite grids, relationships between identifying codes and usual parameters in graphs, structural properties of graphs admitting identifying codes, and number of optimal identifying codes.
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Saenpholphat, Varaporn, and Ping Zhang. "Conditional resolvability in graphs: a survey." International Journal of Mathematics and Mathematical Sciences 2004, no. 38 (2004): 1997–2017. http://dx.doi.org/10.1155/s0161171204311403.

Texto completo da fonte
Resumo:
For an ordered setW={w1,w2,…,wk}of vertices and a vertexvin a connected graphG, the code ofvwith respect toWis thek-vectorcW(v)=(d(v,w1),d(v,w2),…,d(v,wk)), whered(x,y)represents the distance between the verticesxandy. The setWis a resolving set forGif distinct vertices ofGhave distinct codes with respect toW. The minimum cardinality of a resolving set forGis its dimensiondim(G). Many resolving parameters are formed by extending resolving sets to different subjects in graph theory, such as the partition of the vertex set, decomposition and coloring in graphs, or by combining resolving property
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

José, Marco, and Gabriel Zamudio. "Symmetrical Properties of Graph Representations of Genetic Codes: From Genotype to Phenotype." Symmetry 10, no. 9 (2018): 388. http://dx.doi.org/10.3390/sym10090388.

Texto completo da fonte
Resumo:
It has long been claimed that the mitochondrial genetic code possesses more symmetries than the Standard Genetic Code (SGC). To test this claim, the symmetrical structure of the SGC is compared with noncanonical genetic codes. We analyzed the symmetries of the graphs of codons and their respective phenotypic graph representation spanned by the RNY (R purines, Y pyrimidines, and N any of them) code, two RNA Extended codes, the SGC, as well as three different mitochondrial genetic codes from yeast, invertebrates, and vertebrates. The symmetry groups of the SGC and their corresponding phenotypic
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Tang, C. S., and Tyng Liu. "The Degree Code—A New Mechanism Identifier." Journal of Mechanical Design 115, no. 3 (1993): 627–30. http://dx.doi.org/10.1115/1.2919236.

Texto completo da fonte
Resumo:
An important step in the structural synthesis of mechanisms requires the identification of isomorphism between the graphs which represents the mechanism topology. Previously used methods for identifying graph isomorphism either yield incorrect results for some cases or their algorithms are computationally inefficient for this application. This paper describes a new isomorphism identification method which is well suited for the automated structural synthesis of mechanisms. This method uses a new and compact mathematical representation for a graph, called the Degree Code, to identify graph isomo
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Leslie, Martin. "Hypermap-homology quantum codes." International Journal of Quantum Information 12, no. 01 (2014): 1430001. http://dx.doi.org/10.1142/s0219749914300010.

Texto completo da fonte
Resumo:
We introduce a new type of sparse CSS quantum error correcting code based on the homology of hypermaps. Sparse quantum error correcting codes are of interest in the building of quantum computers due to their ease of implementation and the possibility of developing fast decoders for them. Codes based on the homology of embeddings of graphs, such as Kitaev's toric code, have been discussed widely in the literature and our class of codes generalize these. We use embedded hypergraphs, which are a generalization of graphs that can have edges connected to more than two vertices. We develop theorems
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Schlingemann, D. "Stabilizer codes can be realized as graph codes." Quantum Information and Computation 2, no. 4 (2002): 307–23. http://dx.doi.org/10.26421/qic2.4-4.

Texto completo da fonte
Resumo:
We establish the connection between a recent new construction technique for quantum error correcting codes, based on graphs, and the so-called stabilizer codes: Each stabilizer code can be realized as a graph code and vice versa.
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Hwang, Yongsoo, and Jun Heo. "On the relation between a graph code and a graph state." Quantum Information and Computation 16, no. 3&4 (2016): 237–50. http://dx.doi.org/10.26421/qic16.3-4-3.

Texto completo da fonte
Resumo:
A graph state and a graph code respectively are defined based on a mathematical simple graph. In this work, we examine a relation between a graph state and a graph code both obtained from the same graph, and show that a graph state is a superposition of logical qubits of the related graph code. By using the relation, we first discuss that a local complementation which has been used for a graph state can be useful for searching locally equivalent stabilizer codes, and second provide a method to find a stabilizer group of a graph code.
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Al-Kadhimi, Aymen M., Ammar E. Abdulkareem, and Charalampos C. Tsimenidis. "Performance Enhancement of LDPC Codes Based on Protograph Construction in 5G-NR Standard." Tikrit Journal of Engineering Sciences 30, no. 4 (2023): 1–10. http://dx.doi.org/10.25130/tjes.30.4.1.

Texto completo da fonte
Resumo:
To meet the high throughput demands, the 3rd Generation Partnership Project has specified the low-density parity check (LDPC) codes in the fifth generation-new radio 5G-NR standard with rate and length compatibility and scalability. This paper presents an extensive performance evaluation and enhancement of LPDC using the protograph-based construction defined in the 5G-NR standard. Firstly, the protograph-LDPC with layered offset min-sum (OMS) decoding, polar with successive cancellation list (SCL), and block turbo code are implemented and compared. Puncturing and shortening are applied to main
Estilos ABNT, Harvard, Vancouver, APA, etc.
11

Manickam, Machasri, and Kalyani Desikan. "Eigenvalue Interlacing of Bipartite Graphs and Construction of Expander Code using Vertex-split of a Bipartite Graph." European Journal of Pure and Applied Mathematics 17, no. 2 (2024): 772–89. http://dx.doi.org/10.29020/nybg.ejpam.v17i2.5057.

Texto completo da fonte
Resumo:
The second largest eigenvalue of a graph is an important algebraic parameter which is related with the expansion, connectivity and randomness properties of a graph. Expanders are highly connected sparse graphs. In coding theory, Expander codes are Error Correcting codes made up of bipartite expander graphs. In this paper, first we prove the interlacing of the eigenvalues of the adjacency matrix of the bipartite graph with the eigenvalues of the bipartite quotient matrices of the corresponding graph matrices. Then we obtain bounds for the second largest and second smallest eigenvalues. Since th
Estilos ABNT, Harvard, Vancouver, APA, etc.
12

Fimmel, Elena, Christian J. Michel, and Lutz Strüngmann. "n -Nucleotide circular codes in graph theory." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 374, no. 2063 (2016): 20150058. http://dx.doi.org/10.1098/rsta.2015.0058.

Texto completo da fonte
Resumo:
The circular code theory proposes that genes are constituted of two trinucleotide codes: the classical genetic code with 61 trinucleotides for coding the 20 amino acids (except the three stop codons { TAA , TAG , TGA }) and a circular code based on 20 trinucleotides for retrieving, maintaining and synchronizing the reading frame. It relies on two main results: the identification of a maximal C 3 self-complementary trinucleotide circular code X in genes of bacteria, eukaryotes, plasmids and viruses (Michel 2015 J. Theor. Biol. 380, 156–177. ( doi:10.1016/j.jtbi.2015.04.009 ); Arquès & Miche
Estilos ABNT, Harvard, Vancouver, APA, etc.
13

Wenni, Mariza. "BILANGAN KROMATIK LOKASI DARI GRAF P m P n ; K m P n ; DAN K , m K n." Jurnal Matematika UNAND 2, no. 1 (2013): 14. http://dx.doi.org/10.25077/jmu.2.1.14-22.2013.

Texto completo da fonte
Resumo:
Let G and H be two connected graphs. Let c be a vertex k-coloring of aconnected graph G and let = fCg be a partition of V (G) into the resultingcolor classes. For each v 2 V (G), the color code of v is dened to be k-vector: c1; C2; :::; Ck(v) =(d(v; C1); d(v; C2); :::; d(v; Ck)), where d(v; Ci) = minfd(v; x) j x 2 Cg, 1 i k. Ifdistinct vertices have distinct color codes with respect to , then c is called a locatingcoloring of G. The locating chromatic number of G is the smallest natural number ksuch that there are locating coloring with k colors in G. The Cartesian product of graphG and H is a
Estilos ABNT, Harvard, Vancouver, APA, etc.
14

Darmoun, Saber, Abdelmoumen Khalid, and Ben-Azza Hussain. "Heights of error-correcting codes." Gulf Journal of Mathematics 18, no. 2 (2024): 29–46. https://doi.org/10.56947/gjom.v18i2.2397.

Texto completo da fonte
Resumo:
In this work, we investigate the evaluation of odd polynomials P defined on a finite field on the class of error-correcting codes C. We exploit the correspondence between codes and Tanner graphs. Thus, we formally define P(C), a polynomial code. Then the new notion of height of a code emerges, whose properties are studied. We extended the lower bound of Tanner on the minimum distance of a code to the case of a polynomial code, by using spectral graph theory. Computer algebra software enable us to give numerical results to illustrate the theory of polynomial codes for various classes of error-c
Estilos ABNT, Harvard, Vancouver, APA, etc.
15

Ma, Xuanlong, Ruiqin Fu, Xuefei Lu, Mengxia Guo, and Zhiqin Zhao. "Perfect codes in power graphs of finite groups." Open Mathematics 15, no. 1 (2017): 1440–49. http://dx.doi.org/10.1515/math-2017-0123.

Texto completo da fonte
Resumo:
Abstract The power graph of a finite group is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. The enhanced power graph of a finite group is the graph whose vertex set consists of all elements of the group, in which two vertices are adjacent if they generate a cyclic subgroup. In this paper, we give a complete description of finite groups with enhanced power graphs admitting a perfect code. In addition, we describe all groups in the following two classes of finite groups: the class of groups with power graphs admitting a total perfec
Estilos ABNT, Harvard, Vancouver, APA, etc.
16

Sarkar, Rahul, and Theodore J. Yoder. "A graph-based formalism for surface codes and twists." Quantum 8 (July 18, 2024): 1416. http://dx.doi.org/10.22331/q-2024-07-18-1416.

Texto completo da fonte
Resumo:
Twist defects in surface codes can be used to encode more logical qubits, improve the code rate, and implement logical gates. In this work we provide a rigorous formalism for constructing surface codes with twists generalizing the well-defined homological formalism introduced by Kitaev for describing CSS surface codes. In particular, we associate a surface code to any graph G embedded on any 2D-manifold, in such a way that (1) qubits are associated to the vertices of the graph, (2) stabilizers are associated to faces, (3) twist defects are associated to odd-degree vertices. In this way, we are
Estilos ABNT, Harvard, Vancouver, APA, etc.
17

Cappelletti, Luca, Tommaso Fontana, Elena Casiraghi, et al. "GRAPE for fast and scalable graph processing and random-walk-based embedding." Nature Computational Science 3, no. 6 (2023): 552–68. http://dx.doi.org/10.1038/s43588-023-00465-8.

Texto completo da fonte
Resumo:
AbstractGraph representation learning methods opened new avenues for addressing complex, real-world problems represented by graphs. However, many graphs used in these applications comprise millions of nodes and billions of edges and are beyond the capabilities of current methods and software implementations. We present GRAPE (Graph Representation Learning, Prediction and Evaluation), a software resource for graph processing and embedding that is able to scale with big graphs by using specialized and smart data structures, algorithms, and a fast parallel implementation of random-walk-based meth
Estilos ABNT, Harvard, Vancouver, APA, etc.
18

Mudaber, M. H., N. H. Sarmin, and I. Gambo. "Subset Perfect Codes of Finite Commutative Rings Over Induced Subgraphs of Unit Graphs." Malaysian Journal of Mathematical Sciences 16, no. 4 (2022): 783–91. http://dx.doi.org/10.47836/mjms.16.4.10.

Texto completo da fonte
Resumo:
The induced subgraph of a unit graph with vertex set as the non unit elements of a ring R is a graph obtained by deleting all unit elements of R. In a graph 􀀀, a subset of the vertex set is called a perfect code if the balls with radius 1 centred on the subset are pairwise disjoint and their unions yield the whole vertex set. In this paper, we determine the perfect codes of induced subgraphs of the unit graphs associated with some finite commutative rings R with unity that has a vertex set as non unit elements of R. Moreover, we classify the commutative rings in which their associated induced
Estilos ABNT, Harvard, Vancouver, APA, etc.
19

Bliadze, A., and V. Gurevich. "Equivalent to the Probability of Error with Block Error Correction Codes." Telecom IT 7, no. 3 (2019): 1–6. http://dx.doi.org/10.31854/2307-1303-2019-7-3-1-6.

Texto completo da fonte
Resumo:
The probabilities of bit and code errors are compared when using non-redundant and noise-resistant block codes in a digital radio system for transmitting information. The analysis results are accompanied by graphs that allow you to select the bit rate of the noise-tolerant code necessary to ensure the specified probability of code errors.
Estilos ABNT, Harvard, Vancouver, APA, etc.
20

Shin, Jae Kyun, and S. Krishnamurty. "Development of a Standard Code for Colored Graphs and Its Application to Kinematic Chains." Journal of Mechanical Design 116, no. 1 (1994): 189–96. http://dx.doi.org/10.1115/1.2919345.

Texto completo da fonte
Resumo:
The development of an efficient solution procedure for the detection of isomorphism and canonical numbering of vertices of colored graphs is introduced. This computer-based algorithm for colored graphs is formed by extending the standard code approach developed earlier for the canonical numbering of simple noncolored graphs, which fully utilizes the capabilities of symmetry analysis of such noncolored graphs. Its application to various kinematic chains and mechanisms is investigated with the aid of examples. The method never failed to produce unique codes, and is also found to be robust and ef
Estilos ABNT, Harvard, Vancouver, APA, etc.
21

Aouf, H. "Locating Chromatic Number of Middle Graph of Path, Cycle, Star, Wheel, Gear and Helm Graphs." Journal of Combinatorial Mathematics and Combinatorial Computing 119, no. 1 (2024): 335–45. http://dx.doi.org/10.61091/jcmcc119-32.

Texto completo da fonte
Resumo:
Let \(c\) be a proper \(k\)-coloring of a connected graph \(G\) and \(\pi=\{S_{1},S_{2},\ldots,S_{k}\}\) be an ordered partition of the vertex set \(V(G)\) into the resulting color classes, where \(S_{i}\) is the set of all vertices that receive the color \(i\). For a vertex \(v\) of \(G\), the color code \(c_{\pi}(v)\) of \(v\) with respect to \(\pi\) is the ordered \(k\)-tuple \(c_{\pi}(v)=(d(v,S_{1}),d(v,S_{2}),\ldots,d(v,S_{k}))\), where \(d(v,S_{i})=min\{d(v,u):\textit{ } u\in S_{i}\}\) for \(1\leqslant i \leqslant k\). If all distinct vertices of \(G\) have different color codes, then \(
Estilos ABNT, Harvard, Vancouver, APA, etc.
22

Wang, Yun Yun, and Li Zhen Jiang. "Measures of 7-qubit Stabilizer Codes for Graph States." Advanced Materials Research 1049-1050 (October 2014): 1844–47. http://dx.doi.org/10.4028/www.scientific.net/amr.1049-1050.1844.

Texto completo da fonte
Resumo:
Most quantum error-correcting codes constructed are stabilizer codes which are potentially more efficient and significant.Under the concept of graph states theory, we focused on 7-qubit graph states characteristics of stabilizer codes, by calculating and analyzing the entanglement properties of graphical codes. For the instance of code ((7,1,3)) with 16 inequitable graphs, the figure of entanglement properties can be measured.And we analyzed 7-qubit graph characteristics of stabilizers codes and calculated the entanglement measures by iterative algorithm.
Estilos ABNT, Harvard, Vancouver, APA, etc.
23

Joshi, Sandeep S., and Kishor F. Pawar. "ENERGY OF SOME GRAPHS OF PRIME GRAPH OF A RING." Jnanabha 50, no. 01 (2020): 14–19. http://dx.doi.org/10.58250/jnanabha.2020.50101.

Texto completo da fonte
Resumo:
Let R be a commutative ring and PG(R) is a graph whose vertices are all the elements of ring R and two vertices are adjacent if their product is zero. In this article, we study the energy of 1-Quasitotal and 2-Quasitotal Prime Graph of a Ring Zp and also find the energy of PG 1 (Zp ) and PG 2 (Zp ), p prime. A General SCILAB Software code for our calculation is also presented
Estilos ABNT, Harvard, Vancouver, APA, etc.
24

Pilongo, Jupiter, Leonard Mijares Paleta, and Philip Lester P. Benjamin. "Vertex-weighted $(k_{1},k_{2})$ $E$-torsion Graph of Quasi Self-dual Codes." European Journal of Pure and Applied Mathematics 17, no. 2 (2024): 1369–84. http://dx.doi.org/10.29020/nybg.ejpam.v17i2.4867.

Texto completo da fonte
Resumo:
In this paper, we have introduced a graph $G_{EC}$ generated by type-$(k_{1},k_{2})$ $E$-codes which is $(k_{1},k_{2})$ $E$-torsion graph. The binary code words of the torsion code of $C$ are the set of vertices, and the edges are defined using the construction of $E$-codes. Also, we characterized the graph obtained when $k_{1}=0$ and $k_{2}=0$ and calculated the degrees of every vertex and the number of edges of $G_{EC}$. Moreover, we presented necessary and sufficient conditions for a vertex to be in the center of a graph given the property of the code word corresponding to the vertex. Final
Estilos ABNT, Harvard, Vancouver, APA, etc.
25

Seneviratne, P. "Codes from multipartite graphs and minimal permutation decoding sets." Discrete Mathematics, Algorithms and Applications 07, no. 04 (2015): 1550060. http://dx.doi.org/10.1142/s1793830915500603.

Texto completo da fonte
Resumo:
Permutation decoding method developed by MacWilliams and described in [Permutation decoding of systematic codes, Bell Syst. Tech. J. 43 (1964) 485–505] is a decoding technique that uses a subset of the automorphism group of the code called a PD-set. The complexity of the permutation decoding algorithm depends on the size of the PD-set and finding a minimal PD-set for an error correcting code is a hard problem. In this paper we examine binary codes from the complete-multipartite graph [Formula: see text] and find PD-sets for all values of [Formula: see text] and [Formula: see text]. Further we
Estilos ABNT, Harvard, Vancouver, APA, etc.
26

Semri, Ahmed, and Hillal Touati. "Optimal Identifying Codes in Oriented Paths and Circuits." International Journal of Mathematical Models and Methods in Applied Sciences 15 (March 26, 2021): 9–14. http://dx.doi.org/10.46300/9101.2021.15.2.

Texto completo da fonte
Resumo:
Identifying codes in graphs are related to the classical notion of dominating sets [1]. Since there first introduction in 1998 [2], they have been widely studied and extended to several application, such as: detection of faulty processor in multiprocessor systems, locating danger or threats in sensor networks. Let G=(V,E) an unoriented connected graph. The minimum identifying code in graphs is the smallest subset of vertices C, such that every vertex in V have a unique set of neighbors in C. In our work, we focus on finding minimum cardinality of an identifying code in oriented paths and circu
Estilos ABNT, Harvard, Vancouver, APA, etc.
27

Hsu, Cheng-Ho, and Kin-Tak Lam. "Topological code of graphs." Journal of the Franklin Institute 329, no. 1 (1992): 99–109. http://dx.doi.org/10.1016/0016-0032(92)90100-u.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
28

Gold, Robert. "Control flow graphs and code coverage." International Journal of Applied Mathematics and Computer Science 20, no. 4 (2010): 739–49. http://dx.doi.org/10.2478/v10006-010-0056-9.

Texto completo da fonte
Resumo:
Control flow graphs and code coverageThe control flow of programs can be represented by directed graphs. In this paper we provide a uniform and detailed formal basis for control flow graphs combining known definitions and results with new aspects. Two graph reductions are defined using only syntactical information about the graphs, but no semantical information about the represented programs. We prove some properties of reduced graphs and also about the paths in reduced graphs. Based on graphs, we define statement coverage and branch coverage such that coverage notions correspond to node cover
Estilos ABNT, Harvard, Vancouver, APA, etc.
29

Lv, Yijie, Jiguang He, Weikai Xu, and Lin Wang. "Design of Low-Density Parity-Check Code Pair for Joint Source-Channel Coding Systems Based on Graph Theory." Entropy 25, no. 8 (2023): 1189. http://dx.doi.org/10.3390/e25081189.

Texto completo da fonte
Resumo:
In this article, a graph-theoretic method (taking advantage of constraints among sets associated with the corresponding parity-check matrices) is applied for the construction of a double low-density parity-check (D-LDPC) code (also known as LDPC code pair) in a joint source-channel coding (JSCC) system. Specifically, we pre-set the girth of the parity-check matrix for the LDPC code pair when jointly designing the two LDPC codes, which are constructed by following the set constraints. The constructed parity-check matrices for channel codes comprise an identity submatrix and an additional submat
Estilos ABNT, Harvard, Vancouver, APA, etc.
30

Frolov, A. A., and V. V. Zyablov. "Bounds on the minimum code distance for nonbinary codes based on bipartite graphs." Problems of Information Transmission 47, no. 4 (2011): 327–41. http://dx.doi.org/10.1134/s0032946011040028.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
31

Mudaber, Mohammad Hassan, Nor Haniza Sarmin, and Ibrahim Gambo. "Non-Trivial Subring Perfect Codes in Unit Graph of Boolean Rings." Malaysian Journal of Fundamental and Applied Sciences 18, no. 3 (2022): 374–82. http://dx.doi.org/10.11113/mjfas.v18n3.2503.

Texto completo da fonte
Resumo:
The aim of this paper is to investigate the non-trivial subring perfect codes in a unit graph associated with the Boolean rings. We prove a subring perfect code of size , where , in the unit graphs associated with the finite Boolean rings . Moreover, we give a necessary and sufficient condition for a subring of an infinite Boolean ring to be a perfect code of size infinity in the unit graph.
Estilos ABNT, Harvard, Vancouver, APA, etc.
32

Lavi, Inbal, Shai Avidan, Yoram Singer, and Yacov Hel-Or. "Proximity Preserving Binary Code Using Signed Graph-Cut." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 04 (2020): 4535–44. http://dx.doi.org/10.1609/aaai.v34i04.5882.

Texto completo da fonte
Resumo:
We introduce a binary embedding framework, called Proximity Preserving Code (PPC), which learns similarity and dissimilarity between data points to create a compact and affinity-preserving binary code. This code can be used to apply fast and memory-efficient approximation to nearest-neighbor searches. Our framework is flexible, enabling different proximity definitions between data points. In contrast to previous methods that extract binary codes based on unsigned graph partitioning, our system models the attractive and repulsive forces in the data by incorporating positive and negative graph w
Estilos ABNT, Harvard, Vancouver, APA, etc.
33

Ling, Xiang, Lingfei Wu, Saizhuo Wang, et al. "Deep Graph Matching and Searching for Semantic Code Retrieval." ACM Transactions on Knowledge Discovery from Data 15, no. 5 (2021): 1–21. http://dx.doi.org/10.1145/3447571.

Texto completo da fonte
Resumo:
Code retrieval is to find the code snippet from a large corpus of source code repositories that highly matches the query of natural language description. Recent work mainly uses natural language processing techniques to process both query texts (i.e., human natural language) and code snippets (i.e., machine programming language), however, neglecting the deep structured features of query texts and source codes, both of which contain rich semantic information. In this article, we propose an end-to-end deep graph matching and searching (DGMS) model based on graph neural networks for the task of s
Estilos ABNT, Harvard, Vancouver, APA, etc.
34

Li, Chi-Kwong, and Ingrid Nelson. "Perfect codes on the towers of Hanoi graph." Bulletin of the Australian Mathematical Society 57, no. 3 (1998): 367–76. http://dx.doi.org/10.1017/s0004972700031774.

Texto completo da fonte
Resumo:
We characterise all the perfect k-error correcting codes that can be defined on the graph associated with the Towers of Hanoi puzzle. In particular, a short proof for the existence of 1-error correcting code on such a graph is given.
Estilos ABNT, Harvard, Vancouver, APA, etc.
35

Slimani, Djamel, and Abdellah Kaddai. "An improved method for counting 6-cycles in low-density parity-check codes." Serbian Journal of Electrical Engineering 20, no. 1 (2023): 83–91. http://dx.doi.org/10.2298/sjee2301083s.

Texto completo da fonte
Resumo:
Since their rediscovery in the early 1990s, low-density parity-check (LDPC) codes have become the most popular error-correcting codes owing to their excellent performance. An LDPC code is a linear block code that has a sparse parity-check matrix. Cycles in this matrix, particularly short cycles, degrade the performance of such a code. Hence, several methods for counting short cycles in LDPC codes have been proposed, such as Fan?s method to detect 4-cycles, 6- cycles, 8-cycles, and 10-cycles. Unfortunately, this method fails to count all 6- cycles, i.e., ignores numerous 6-cycles, in some given
Estilos ABNT, Harvard, Vancouver, APA, etc.
36

Bao, Xingkai, and Jing Li. "Adaptive network coded cooperation (ANCC) for wireless relay networks: matching code-on-graph with network-on-graph." IEEE Transactions on Wireless Communications 7, no. 2 (2008): 574–83. http://dx.doi.org/10.1109/twc.2008.060439.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
37

Pareja, Aldo, Giacomo Domeniconi, Jie Chen, et al. "EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 04 (2020): 5363–70. http://dx.doi.org/10.1609/aaai.v34i04.5984.

Texto completo da fonte
Resumo:
Graph representation learning resurges as a trending research subject owing to the widespread use of deep learning for Euclidean data, which inspire various creative designs of neural networks in the non-Euclidean domain, particularly graphs. With the success of these graph neural networks (GNN) in the static setting, we approach further practical scenarios where the graph dynamically evolves. Existing approaches typically resort to node embeddings and use a recurrent neural network (RNN, broadly speaking) to regulate the embeddings and learn the temporal dynamics. These methods require the kn
Estilos ABNT, Harvard, Vancouver, APA, etc.
38

Raza, Mohd Arif, Adel N. Alahmadi, Widyan Basaffar, et al. "The Quantum States of a Graph." Mathematics 11, no. 10 (2023): 2310. http://dx.doi.org/10.3390/math11102310.

Texto completo da fonte
Resumo:
Quantum codes are crucial building blocks of quantum computers. With a self-dual quantum code is attached, canonically, a unique stabilised quantum state. Improving on a previous publication, we show how to determine the coefficients on the basis of kets in these states. Two important ingredients of the proof are algebraic graph theory and quadratic forms. The Arf invariant, in particular, plays a significant role.
Estilos ABNT, Harvard, Vancouver, APA, etc.
39

Steinert, Patrick, Stefan Wagenpfeil, Paul Mc Kevitt, Ingo Frommholz, and Matthias Hemmje. "Parallelization Strategies for Graph-Code-Based Similarity Search." Big Data and Cognitive Computing 7, no. 2 (2023): 70. http://dx.doi.org/10.3390/bdcc7020070.

Texto completo da fonte
Resumo:
The volume of multimedia assets in collections is growing exponentially, and the retrieval of information is becoming more complex. The indexing and retrieval of multimedia content is generally implemented by employing feature graphs. Feature graphs contain semantic information on multimedia assets. Machine learning can produce detailed semantic information on multimedia assets, reflected in a high volume of nodes and edges in the feature graphs. While increasing the effectiveness of the information retrieval results, the high level of detail and also the growing collections increase the proce
Estilos ABNT, Harvard, Vancouver, APA, etc.
40

Albuquerque, C. D., R. Palazzo Jr., and E. B. Silva. "New classes of TQC associated with self-dual, quasi self-dual and denser tessellations." Quantum Information and Computation 10, no. 11&12 (2010): 956–70. http://dx.doi.org/10.26421/qic10.11-12-6.

Texto completo da fonte
Resumo:
In this paper we present six classes of topological quantum codes (TQC) on compact surfaces with genus $g\ge 2$. These codes are derived from self-dual, quasi self-dual and denser tessellations associated with embeddings of self-dual complete graphs and complete bipartite graphs on the corresponding compact surfaces. The majority of the new classes has the self-dual tessellations as their algebraic and geometric supporting mathematical structures. Every code achieves minimum distance 3 and its encoding rate is such that $\frac{k}{n} \rightarrow 1$ as $n \rightarrow \infty$, except for the one
Estilos ABNT, Harvard, Vancouver, APA, etc.
41

Kahl, Wolfram. "Towards “mouldable code” via nested code graph transformation." Journal of Logical and Algebraic Methods in Programming 83, no. 2 (2014): 225–34. http://dx.doi.org/10.1016/j.jlap.2014.02.010.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
42

Nie, Peng, Huanqin Wu, and Zhanchuan Cai. "Towards Automatic ICD Coding via Label Graph Generation." Mathematics 12, no. 15 (2024): 2398. http://dx.doi.org/10.3390/math12152398.

Texto completo da fonte
Resumo:
Automatic International Classification of Disease (ICD) coding, a system for assigning proper codes to a given clinical text, has received increasing attention. Previous studies have focused on formulating the ICD coding task as a multi-label prediction approach, exploring the relationship between clinical texts and ICD codes, parent codes and child codes, and siblings. However, the large search space of ICD codes makes it difficult to localize target labels. Moreover, there exists a great unbalanced distribution of ICD codes at different levels. In this work, we propose LabGraph, which transf
Estilos ABNT, Harvard, Vancouver, APA, etc.
43

Baspin, Nouédyn, and Anirudh Krishna. "Connectivity constrains quantum codes." Quantum 6 (May 13, 2022): 711. http://dx.doi.org/10.22331/q-2022-05-13-711.

Texto completo da fonte
Resumo:
Quantum low-density parity-check (LDPC) codes are an important class of quantum error correcting codes. In such codes, each qubit only affects a constant number of syndrome bits, and each syndrome bit only relies on some constant number of qubits. Constructing quantum LDPC codes is challenging. It is an open problem to understand if there exist good quantum LDPC codes, i.e. with constant rate and relative distance. Furthermore, techniques to perform fault-tolerant gates are poorly understood. We present a unified way to address these problems. Our main results are a) a bound on the distance, b
Estilos ABNT, Harvard, Vancouver, APA, etc.
44

Perezhogin, Aleksey Lvovich, and Igor Sergeevich Bykov. "Overview of constructions and properties of Gray codes." Mathematical Problems of Cybernetics, no. 20 (2022): 41–60. http://dx.doi.org/10.20948/mvk-2022-41.

Texto completo da fonte
Resumo:
Cyclic enumeration of binary words of length n, where each pair of adjacent words differs in exactly one index, is called n-dimensional Gray code. Gray code determines hamiltonian cycle in boolean n-cube. In this paper we give a review of constructions and classifications of Gray codes. Constructions are divided into three main groups: recursive, toric and stream. We also give some of Gray code properties, as an example of applications of these constructions. In particular, we consider spectrum of edge directions, graphs of 2-subwords in transition sequence, local uniformity and others. Also s
Estilos ABNT, Harvard, Vancouver, APA, etc.
45

Choo, Kelly, and Gary MacGillivray. "Gray code numbers for graphs." Ars Mathematica Contemporanea 4, no. 1 (2011): 125–39. http://dx.doi.org/10.26493/1855-3974.196.0df.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
46

Raspaud, André, and Li-Da Tong. "The minimum identifying code graphs." Discrete Applied Mathematics 160, no. 9 (2012): 1385–89. http://dx.doi.org/10.1016/j.dam.2012.01.015.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
47

Klavžar, Sandi, Uroš Milutinović, and Ciril Petr. "1-perfect codes in Sierpiński graphs." Bulletin of the Australian Mathematical Society 66, no. 3 (2002): 369–84. http://dx.doi.org/10.1017/s0004972700040235.

Texto completo da fonte
Resumo:
Sierpiński graphs S (n, κ) generalise the Tower of Hanoi graphs—the graph S (n, 3) is isomorphic to the graph Hn of the Tower of Hanoi with n disks. A 1-perfect code (or an efficient dominating set) in a graph G is a vertex subset of G with the property that the closed neighbourhoods of its elements form a partition of V (G). It is proved that the graphs S (n, κ) possess unique 1-perfect codes, thus extending a previously known result for Hn. An efficient decoding algorithm is also presented. The present approach, in particular the proposed (de)coding, is intrinsically different from the appro
Estilos ABNT, Harvard, Vancouver, APA, etc.
48

Høholdt, Tom, and Jørn Justesen. "On the sizes of expander graphs and minimum distances of graph codes." Discrete Mathematics 325 (June 2014): 38–46. http://dx.doi.org/10.1016/j.disc.2014.02.005.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
49

Sun, Jiang Hong. "Kinematic Chain Isomorphism Identification Based on Loop-Code." Applied Mechanics and Materials 44-47 (December 2010): 3874–78. http://dx.doi.org/10.4028/www.scientific.net/amm.44-47.3874.

Texto completo da fonte
Resumo:
A new method approach is presented to solve isomorphism identification of kinematic chain topology graphs. Kinematic chain topology graphs are depicted with loop-code based on the characteristic of kinematic chain topology graphs. The number of binary links in the limbs of topology graphs is arranged in group according to links with multi points of connection．Although the order of limbs in the groups and the order of links with multi points of connection outside the groups can change, the planar message of topology graphs can not change. Thereby forming loop-code.This representation is straigh
Estilos ABNT, Harvard, Vancouver, APA, etc.
50

Durcek, Viktor, Michal Kuba, and Milan Dado. "Investigation of random-structure regular LDPC codes construction based on progressive edge-growth and algorithms for removal of short cycles." Eastern-European Journal of Enterprise Technologies 4, no. 9(112) (2021): 46–53. http://dx.doi.org/10.15587/1729-4061.2021.225852.

Texto completo da fonte
Resumo:
This paper investigates the construction of random-structure LDPC (low-density parity-check) codes using Progressive Edge-Growth (PEG) algorithm and two proposed algorithms for removing short cycles (CB1 and CB2 algorithm; CB stands for Cycle Break). Progressive Edge-Growth is an algorithm for computer-based design of random-structure LDPC codes, the role of which is to generate a Tanner graph (a bipartite graph, which represents a parity-check matrix of an error-correcting channel code) with as few short cycles as possible. Short cycles, especially the shortest ones with a length of 4 edges,
Estilos ABNT, Harvard, Vancouver, APA, etc.
Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!

Vá para a bibliografia