{"title":"On the Calculation of the Minimum Distance of a Linear Code","authors":"I. Bouyukliev","doi":"10.55630/stem.2021.0317","DOIUrl":null,"url":null,"abstract":"Some aspects of the algorithms for calculating the minimum distance of linear codes over finite fields are presented.","PeriodicalId":183669,"journal":{"name":"Innovative STEM Education","volume":"82 6","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Innovative STEM Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.55630/stem.2021.0317","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Some aspects of the algorithms for calculating the minimum distance of linear codes over finite fields are presented.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
