{"title":"计算线性码伪码字的zeta函数","authors":"S. Matsuda, S. Saito, T. Hiramatsu","doi":"10.1109/ISITA.2008.4895507","DOIUrl":null,"url":null,"abstract":"It is described in this document how to compute zeta functions counting unscaled pseudo-codewords of general binary linear codes. This zeta functions are introduced in [2] for cycle codes and extended in [3] for general linear codes. Especially, we show that the zeta functions of codes are computed by using a 1/2 size determinants compared to those of [3] for non-cycle codes.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computation of zeta functions counting pseudo-codewords of linear codes\",\"authors\":\"S. Matsuda, S. Saito, T. Hiramatsu\",\"doi\":\"10.1109/ISITA.2008.4895507\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is described in this document how to compute zeta functions counting unscaled pseudo-codewords of general binary linear codes. This zeta functions are introduced in [2] for cycle codes and extended in [3] for general linear codes. Especially, we show that the zeta functions of codes are computed by using a 1/2 size determinants compared to those of [3] for non-cycle codes.\",\"PeriodicalId\":338675,\"journal\":{\"name\":\"2008 International Symposium on Information Theory and Its Applications\",\"volume\":\"94 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Information Theory and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITA.2008.4895507\",\"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 Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895507","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Computation of zeta functions counting pseudo-codewords of linear codes
It is described in this document how to compute zeta functions counting unscaled pseudo-codewords of general binary linear codes. This zeta functions are introduced in [2] for cycle codes and extended in [3] for general linear codes. Especially, we show that the zeta functions of codes are computed by using a 1/2 size determinants compared to those of [3] for non-cycle codes.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
