Results 31 to 40 of about 4,703 (164)
Arithmetic completely regular codes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression.
Jacobus Koolen +3 more
doaj +1 more source
Multipartite information of free fermions on Hamming graphs
Nuclear Physics B, 2023 We investigate multipartite information and entanglement measures in the ground state of a free-fermion model defined on a Hamming graph. Using the known diagonalization of the adjacency matrix, we solve the model and construct the ground-state ...
Gilles Parez +3 more
doaj +1 more source
s-Elusive codes in Hamming graphs [PDF]
Designs, Codes and Cryptography, 2021 A code is a subset of the vertex set of a Hamming graph. The set of $s$-neighbours of a code is the set of all vertices at Hamming distance $s$ from their nearest codeword. A code $C$ is $s$-elusive if there exists a distinct code $C'$ that is equivalent to $C$ under the full automorphism group of the Hamming graph such that $C$ and $C'$ have the same ...
openaire +4 more sources
Eccentric Harmonic Index for the Cartesian Product of Graphs
Journal of Mathematics, 2022 Suppose ρ is a simple graph, then its eccentric harmonic index is defined as the sum of the terms 2/ea+eb for the edges vavb, where ea is the eccentricity of the ath vertex of the graph ρ. We symbolize the eccentric harmonic index (EHI) as He=Heρ.
Kamel Jebreen +5 more
doaj +1 more source
On k-partitioning of Hamming graphs
Discrete Applied Mathematics, 1999 For a graph \(G=(V,E)\) a \(k\)-partition is a partition \(A=\{A_1, A_2, \dots, A_k \}\) of \(V\) such that \(||A_i|- |A_j||\leq 1\) for all \(i,j\in \{1,2,\dots, k\}\). A cut of partition \(A\) is a set of edges having ends in different sets of the partition.
Sergei L. Bezrukov +2 more
openaire +2 more sources
Some bounds for the relative generalized Hamming weights of some evaluation codes
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 In this paper we find some bounds for the relative generalized Hamming weights of some codes parameterized by a set of monomials of the same degree.
Sarabia Manuel González
doaj +1 more source
How Long Can One Bluff in the Domination Game?
Discussiones Mathematicae Graph Theory, 2017 The domination game is played on an arbitrary graph G by two players, Dominator and Staller. The game is called Game 1 when Dominator starts it, and Game 2 otherwise.
Brešar Boštan +3 more
doaj +1 more source
l1-Embeddability Under Gate-Sum Operation of Two l1-Graphs
Frontiers in Physics, 2020 An l1-graph is one in which the vertices can be labeled by binary vectors such that the Hamming distance between two binary addresses is, to scale, the distance in the graph between the corresponding vertices. This study was designed to determine whether
Guangfu Wang, Chenyang Li, Fengling Wang
doaj +1 more source
Remote Sensing, 2021 As satellite observation technology rapidly develops, the number of remote sensing (RS) images dramatically increases, and this leads RS image retrieval tasks to be more challenging in terms of speed and accuracy.
Zhen Wang +4 more
doaj +1 more source
Perfect 2‐colorings of Hamming graphs [PDF]
Journal of Combinatorial Designs, 2021 AbstractWe consider the problem of existence of perfect 2‐colorings (equitable 2‐partitions) of Hamming graphs with given parameters. We start with conditions on parameters of graphs and colorings that are necessary for their existence. Next we observe known constructions of perfect colorings and propose some new ones giving new parameters. At last, we
Evgeny A. Bespalov +4 more
openaire +2 more sources