{"title":"关于有限环上的 DNA 代码及其相关参数","authors":"Chella Pandian P","doi":"10.56947/amcs.v19.216","DOIUrl":null,"url":null,"abstract":"In this paper, lower bound and upper bound on the covering radius of DNA codes over N with respect to euclidean distance are given. Also determine the covering radius of various Repetition DNA codes, Simplex DNA code Type α and Simplex DNA code Type β and bounds on the covering radius for MacDonald DNA codes of both types over N.","PeriodicalId":504658,"journal":{"name":"Annals of Mathematics and Computer Science","volume":"69 17","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On DNA code over a finite ring and its related parameters\",\"authors\":\"Chella Pandian P\",\"doi\":\"10.56947/amcs.v19.216\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, lower bound and upper bound on the covering radius of DNA codes over N with respect to euclidean distance are given. Also determine the covering radius of various Repetition DNA codes, Simplex DNA code Type α and Simplex DNA code Type β and bounds on the covering radius for MacDonald DNA codes of both types over N.\",\"PeriodicalId\":504658,\"journal\":{\"name\":\"Annals of Mathematics and Computer Science\",\"volume\":\"69 17\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Mathematics and Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.56947/amcs.v19.216\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Mathematics and Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.56947/amcs.v19.216","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
本文给出了关于欧几里得距离的 N 上 DNA 码覆盖半径的下限和上限。还确定了 N 上各种重复 DNA 码、α 型简约 DNA 码和β型简约 DNA 码的覆盖半径，以及两种类型的 MacDonald DNA 码的覆盖半径边界。
On DNA code over a finite ring and its related parameters
In this paper, lower bound and upper bound on the covering radius of DNA codes over N with respect to euclidean distance are given. Also determine the covering radius of various Repetition DNA codes, Simplex DNA code Type α and Simplex DNA code Type β and bounds on the covering radius for MacDonald DNA codes of both types over N.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
