{"title":"两类线性码的极小格结构","authors":"Qinghui Lan, Haibin Kan","doi":"10.1109/ICICSE.2008.48","DOIUrl":null,"url":null,"abstract":"Trellis representations of linear block codes not only illustrate code structure, but also often lead to efficient trellis-based decoding algorithms. In this paper, we try to find the minimal trellises for two important classes of linear codes, i.e., cyclic codes and quasi-cyclic codes.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"141 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimal Trellises for Two Classes of Linear Codes\",\"authors\":\"Qinghui Lan, Haibin Kan\",\"doi\":\"10.1109/ICICSE.2008.48\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Trellis representations of linear block codes not only illustrate code structure, but also often lead to efficient trellis-based decoding algorithms. In this paper, we try to find the minimal trellises for two important classes of linear codes, i.e., cyclic codes and quasi-cyclic codes.\",\"PeriodicalId\":333889,\"journal\":{\"name\":\"2008 International Conference on Internet Computing in Science and Engineering\",\"volume\":\"141 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-01-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Internet Computing in Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICSE.2008.48\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Internet Computing in Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICSE.2008.48","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Trellis representations of linear block codes not only illustrate code structure, but also often lead to efficient trellis-based decoding algorithms. In this paper, we try to find the minimal trellises for two important classes of linear codes, i.e., cyclic codes and quasi-cyclic codes.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
