On codes with given minimum distance and covering radius.
On codes with given minimum distance and covering radius.
On extremal additive codes of length to
In this paper we consider the extremal even self-dual -additive codes. We give a complete classification for length . Under the hypothesis that at least two minimal words have the same support, we classify the codes of length and we show that in length such a code is equivalent to the unique -hermitian code with parameters [18,9,8]. We construct with the help of them some extremal -modular lattices.
On identifying codes in the King grid that are robust against edge deletions.
On mixed codes with covering radius 1 and minimum distance 2.
On the failing cases of the Johnson bound for error-correcting codes.
Optimal Locating-Total Dominating Sets in Strips of Height 3
A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjacent to a vertex of C. Furthermore, if a total dominating set C in G has the additional property that for any distinct vertices u, v ∈ V C the subsets formed by the vertices of C respectively adjacent to u and v are different, then we say that C is a locating-total dominating set in G. Previously, locating-total dominating sets in strips have been studied by Henning and Jafari Rad (2012). In particular,...