Abstract: The basis for designing error-correcting codes for two dimensional signal sets is considered in this paper. Both, algebraic and graph-theoretical ...
We introduce in this research a suitable metric for codes over the Gaussian integers based on the distance among vertices in Circulant graphs. Circulant graphs ...
We present in this research an algebraic methodology to find perfect t-dominating sets in Gaussian graphs, which is particularly interesting in Coding Theory ...
On the perfect t-dominating set problem in circulant graphs and codes over Gaussian integers. C Martínez, R Beivide, J Gutierrez, EM Gabidulin. Proceedings.
On the perfect t-dominating set problem in circulant graphs and codes over Gaussian integers. C Martínez, R Beivide, J Gutierrez, EM Gabidulin. Proceedings.
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 ...
The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and is denoted by $\gamma_t(G)$. The total domination ...
Oct 22, 2024 · A new family of perfect codes over Gaussian integers will be defined and characterized by providing a solution to the perfect t-dominating set ...
... codes over Gaussian integers will be defined and characterized by providing a solution to the perfect t-dominating set problem over the circulant graphs ...
... codes over Gaussian integers will be defined and characterized by providing a solution to the perfect t-dominating set problem over the circulant graphs ...