Sep 10, 2024 · We investigate the maximum size of graph families on a common vertex set of cardinality n n such that the symmetric difference of the edge ...
We investigate the maximum size of graph families on a common vertex set of cardinality n such that the symmetric difference of the edge sets of any two ...
Bibliographic details on Codes with structured Hamming distance in graph families.
In this paper we study several problems we arrive to if the basic code distance problem. (how many binary sequences of a given length can be given at most if ...
Linear codes are either studied as generic vector spaces without any known structure, or as particular sub-families with special properties. The class sage.
Jun 1, 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 ...
These are completely regular codes such that the cells of the distance partition are orbits of some group of automorphisms of the graph. This paper looks at ...
Jul 21, 2016 · We examine designs and binary codes associated with the Hamming graphs H(n,m) where n, m are integers. In particular, for m=3, we obtain the ...
People also ask
What is the Hamming distance between graphs?
What is the Hamming distance between two equal code words?
What is hamming weight and Hamming distance of code word?
What is the difference between Hamming code and Hamming distance?
In this paper we study several problems we arrive at if the basic code distance problem (how many binary sequences of a given length can be given at most if any ...
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 ...