Learn More
A set D of vertices in a graph G = (V, E) is a dominating set of G if every vertex in V −D is adjacent to some vertex in D. The domination number γ(G) of G is the minimum cardinality of a dominating set. We define the cobondage number b c (G) of G to be the minimum cardinality among the sets of edges X ⊆ P 2 (V) − E, where P 2 (V) = {X ⊆ V : |X| = 2} such(More)
Cellular Automata (CA) is a novel approach for designing byte error-correcting codes. The regular, modular and cascaded structure of CA can be economically built with VLSI technology. In this correspondence, a modular architecture of CA based (32, 28) byte error correcting encoder and decoder has been proposed. The design is capable of locating and(More)
  • 1