Grafos conexos e controle em códigos de treliça

Abstract

—The trellis of a binary convolutional code is a connected graph, that is, all the states are connected by some path that is compounded by the concatenation of transitions labeled by encoded bits. When the convolucional code is not binary, then its trellis can be a disconnected graph. In this work it is shown the equivalence between connectedness of graphs and controllability of group codes which are generated from extensions of groups. More precisely; given a group G as an extension U by S , i