New Perfect and Distance-Optimal Sum-Rank Codes

arXiv - CS - Information Theory Pub Date : 2024-01-20 DOI:arxiv-2401.11160

Hao Chen

{"title":"New Perfect and Distance-Optimal Sum-Rank Codes","authors":"Hao Chen","doi":"arxiv-2401.11160","DOIUrl":null,"url":null,"abstract":"Constructions of infinite families of distance-optimal codes in the Hamming\nmetric and the sum-rank metric are challenging problems and have attracted many\nattentions. In this paper, we give the following three results. 1) If $\\lambda|q^{sm}-1$ and $\\lambda\n<\\sqrt{\\frac{(q^s-1)}{2(q-1)^2(1+\\epsilon)}}$, an infinite family of\ndistance-optimal $q$-ary cyclic sum-rank codes with the block length\n$t=\\frac{q^{sm}-1}{\\lambda}$, the matrix size $s \\times s$, the cardinality\n$q^{s^2t-s(2m+3)}$ and the minimum sum-rank distance four is constructed. 2) Block length $q^4-1$ and the matrix size $2 \\times 2$ distance-optimal\nsum-rank codes with the minimum sum-rank distance four and the Singleton defect\nfour are constructed. These sum-rank codes are close to the sphere packing\nbound , the Singleton-like bound and have much larger block length\n$q^4-1>>q-1$. 3) For given positive integers $n$ and $m$ satisfying $m<n$, an infinite\nfamily of perfect sum-rank codes with the matrix size $m \\times n$, and the\nminimum sum-rank distance three is also constructed. The construction of perfect sum-rank codes of the matrix size $m \\times n$,\n$1<m<n$, answers the open problem proposed by U. Mart\\'{\\i}nez-Pe\\~{n}as in\n2019 positively.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"5 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2401.11160","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

Abstract

Constructions of infinite families of distance-optimal codes in the Hamming metric and the sum-rank metric are challenging problems and have attracted many attentions. In this paper, we give the following three results. 1) If $\lambda|q^{sm}-1$ and $\lambda <\sqrt{\frac{(q^s-1)}{2(q-1)^2(1+\epsilon)}}$, an infinite family of distance-optimal $q$-ary cyclic sum-rank codes with the block length $t=\frac{q^{sm}-1}{\lambda}$, the matrix size $s \times s$, the cardinality $q^{s^2t-s(2m+3)}$ and the minimum sum-rank distance four is constructed. 2) Block length $q^4-1$ and the matrix size $2 \times 2$ distance-optimal sum-rank codes with the minimum sum-rank distance four and the Singleton defect four are constructed. These sum-rank codes are close to the sphere packing bound , the Singleton-like bound and have much larger block length $q^4-1>>q-1$. 3) For given positive integers $n$ and $m$ satisfying $m

查看原文