{"title":"Grafos conexos e controle em códigos de treliça","authors":"J. Arpasi, E. Carvalho, L. Tibola","doi":"10.14209/sbrt.2008.42127","DOIUrl":null,"url":null,"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","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14209/sbrt.2008.42127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
