{"title":"Linear Codes Over a General Infinite Family of Rings and Macwilliams-Type Relations","authors":"Irwansyah, D. Suprijanto","doi":"10.47443/dml.2022.091","DOIUrl":null,"url":null,"abstract":"We study structural properties of linear codes over the ring R k which is defined by R [ v 1 , v 2 , . . . , v k ] with conditions v 2 i = v i for i = 1 , 2 , . . . , k , where R is any finite commutative Frobenius ring. We describe these linear codes in terms of necessary and sufficient conditions involving Gray maps, and we use these characterizations to construct Hermitian and Euclidean self-dual linear codes of this ring of arbitrary given length. We also derive MacWilliams-type relations for these codes with respect to Hamming weight enumerator as well as complete and symmetrized weight enumerators. As an application of the obtained results, we construct several optimal linear codes over Z 4 .","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":" ","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2022-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2022.091","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1
Abstract
We study structural properties of linear codes over the ring R k which is defined by R [ v 1 , v 2 , . . . , v k ] with conditions v 2 i = v i for i = 1 , 2 , . . . , k , where R is any finite commutative Frobenius ring. We describe these linear codes in terms of necessary and sufficient conditions involving Gray maps, and we use these characterizations to construct Hermitian and Euclidean self-dual linear codes of this ring of arbitrary given length. We also derive MacWilliams-type relations for these codes with respect to Hamming weight enumerator as well as complete and symmetrized weight enumerators. As an application of the obtained results, we construct several optimal linear codes over Z 4 .