Aug 27, 2007 · Abstract: An algebraic methodology for defining new metrics over two-dimensional signal spaces is presented in this work.
A perfect code in a graph Γ = ( V , E ) is a subset C of V that is an independent set such that every vertex in V ∖ C is adjacent to exactly one vertex in C ...
Abstract—An algebraic methodology for defining new metrics over two-dimensional signal spaces is presented in this work. We.
Oct 22, 2024 · An algebraic methodology for defining new metrics over two-dimensional signal spaces is presented in this work. We have mainly considered ...
Oct 22, 2024 · A perfect code in a graph Γ = ( V , E ) \Gamma = (V, E) is a subset C C of V V that is an independent set such that every vertex in V ∖ C V ...
Mar 25, 2017 · In this paper we give a necessary and sufficient condition for a circulant graph of degree p-1 to admit a perfect code, where p is an odd prime.
Missing: Metrics | Show results with:Metrics
This paper studies perfect codes and total perfect codes in Cayley graphs ... Perfect Codes for Metrics Induced by Circulant Graphs · C. MartínezR. BeivideE ...
People also ask
What is the perfect code of a graph?
What are circulant graphs?
What is the chromatic number of a circulant graph?
Mar 25, 2017 · Abstract. A perfect code in a graph Γ=(V,E) is a subset C of V that is an independent set such that every vertex in V \ C is adjacent to ...
A perfect code in a graph =(V,E) is a subset C of V that is an independent set such that every vertex in VC is adjacent to exactly one vertex in C. A total ...
[PDF] perfect codes over hurwitz integers induced by circulant graphs
dergipark.org.tr › article-file
Gabidulin, Perfect codes for metrics induced by circulant graphs,. IEEE Trans. Inf. Theory 53, pp. 3042-3052, (2007). [14] J. Schönheim, On linear and ...