{"title":"有限链环上自由循环码的一些性质","authors":"M. Sabiri, Youssef Bensalih, A. Elbour","doi":"10.1145/3386723.3387856","DOIUrl":null,"url":null,"abstract":"Free codes are investigated. It is illustrated that every free cyclic has some important proprieties and the minimal distance of every code depends upon its associated direct component.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Some Properties of Free Cyclic Codes over Finite Chain Rings\",\"authors\":\"M. Sabiri, Youssef Bensalih, A. Elbour\",\"doi\":\"10.1145/3386723.3387856\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Free codes are investigated. It is illustrated that every free cyclic has some important proprieties and the minimal distance of every code depends upon its associated direct component.\",\"PeriodicalId\":139072,\"journal\":{\"name\":\"Proceedings of the 3rd International Conference on Networking, Information Systems & Security\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 3rd International Conference on Networking, Information Systems & Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3386723.3387856\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3386723.3387856","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Some Properties of Free Cyclic Codes over Finite Chain Rings
Free codes are investigated. It is illustrated that every free cyclic has some important proprieties and the minimal distance of every code depends upon its associated direct component.