关于距离为6的线性直径完美Lee码

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A Pub Date : 2023-09-22 DOI:10.1016/j.jcta.2023.105816

Tao Zhang , Gennian Ge

{"title":"关于距离为6的线性直径完美Lee码","authors":"Tao Zhang , Gennian Ge","doi":"10.1016/j.jcta.2023.105816","DOIUrl":null,"url":null,"abstract":"<div>In 1968, Golomb and Welch conjectured that there is no perfect Lee codes with radius <math><mi>r</mi><mo>≥</mo><mn>2</mn></math> and dimension <math><mi>n</mi><mo>≥</mo><mn>3</mn></math>. A diameter perfect code is a natural generalization of the perfect code. In 2011, Etzion (2011) [5] proposed the following problem: Are there diameter perfect Lee (DPL, for short) codes with distance greater than four besides the <math><mi>D</mi><mi>P</mi><mi>L</mi><mo>(</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>)</mo></math> code? Later, Horak and AlBdaiwi (2012) [12] conjectured that there are no <math><mi>D</mi><mi>P</mi><mi>L</mi><mo>(</mo><mi>n</mi><mo>,</mo><mi>d</mi><mo>)</mo></math> codes for dimension <math><mi>n</mi><mo>≥</mo><mn>3</mn></math> and distance <math><mi>d</mi><mo>></mo><mn>4</mn></math> except for <math><mo>(</mo><mi>n</mi><mo>,</mo><mi>d</mi><mo>)</mo><mo>=</mo><mo>(</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>)</mo></math>. In this paper, we give a counterexample to this conjecture. Moreover, we prove that for <math><mi>n</mi><mo>≥</mo><mn>3</mn></math>, there is a linear <math><mi>D</mi><mi>P</mi><mi>L</mi><mo>(</mo><mi>n</mi><mo>,</mo><mn>6</mn><mo>)</mo></math> code if and only if <math><mi>n</mi><mo>=</mo><mn>3</mn><mo>,</mo><mn>11</mn></math>.</div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"201 ","pages":"Article 105816"},"PeriodicalIF":0.9000,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On linear diameter perfect Lee codes with distance 6\",\"authors\":\"Tao Zhang , Gennian Ge\",\"doi\":\"10.1016/j.jcta.2023.105816\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>In 1968, Golomb and Welch conjectured that there is no perfect Lee codes with radius <math><mi>r</mi><mo>≥</mo><mn>2</mn></math> and dimension <math><mi>n</mi><mo>≥</mo><mn>3</mn></math>. A diameter perfect code is a natural generalization of the perfect code. In 2011, Etzion (2011) [5] proposed the following problem: Are there diameter perfect Lee (DPL, for short) codes with distance greater than four besides the <math><mi>D</mi><mi>P</mi><mi>L</mi><mo>(</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>)</mo></math> code? Later, Horak and AlBdaiwi (2012) [12] conjectured that there are no <math><mi>D</mi><mi>P</mi><mi>L</mi><mo>(</mo><mi>n</mi><mo>,</mo><mi>d</mi><mo>)</mo></math> codes for dimension <math><mi>n</mi><mo>≥</mo><mn>3</mn></math> and distance <math><mi>d</mi><mo>></mo><mn>4</mn></math> except for <math><mo>(</mo><mi>n</mi><mo>,</mo><mi>d</mi><mo>)</mo><mo>=</mo><mo>(</mo><mn>3</mn><mo>,</mo><mn>6</mn><mo>)</mo></math>. In this paper, we give a counterexample to this conjecture. Moreover, we prove that for <math><mi>n</mi><mo>≥</mo><mn>3</mn></math>, there is a linear <math><mi>D</mi><mi>P</mi><mi>L</mi><mo>(</mo><mi>n</mi><mo>,</mo><mn>6</mn><mo>)</mo></math> code if and only if <math><mi>n</mi><mo>=</mo><mn>3</mn><mo>,</mo><mn>11</mn></math>.</div>\",\"PeriodicalId\":50230,\"journal\":{\"name\":\"Journal of Combinatorial Theory Series A\",\"volume\":\"201 \",\"pages\":\"Article 105816\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory Series A\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0097316523000845\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316523000845","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 1

摘要

1968年，Golomb和Welch猜想不存在半径r≥2、维数n≥3的完美李码。直径完美码是完美码的自然推广。2011年，Etzion（2011）[5]提出了以下问题：除了DPL（3,6）码之外，是否存在距离大于4的直径完美Lee（简称DPL）码？后来，Horak和AlBdaiwi（2012）[12]推测，对于维数n≥3和距离d>；4，除了（n，d）=（3,6）。在本文中，我们给出了一个反例。此外，我们证明了对于n≥3，存在线性DPL（n，6）码当且仅当n=3,11。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On linear diameter perfect Lee codes with distance 6

In 1968, Golomb and Welch conjectured that there is no perfect Lee codes with radius $r \geq 2$ and dimension $n \geq 3$ . A diameter perfect code is a natural generalization of the perfect code. In 2011, Etzion (2011) [5] proposed the following problem: Are there diameter perfect Lee (DPL, for short) codes with distance greater than four besides the $D P L (3, 6)$ code? Later, Horak and AlBdaiwi (2012) [12] conjectured that there are no $D P L (n, d)$ codes for dimension $n \geq 3$ and distance $d > 4$ except for $(n, d) = (3, 6)$ . In this paper, we give a counterexample to this conjecture. Moreover, we prove that for $n \geq 3$ , there is a linear $D P L (n, 6)$ code if and only if $n = 3, 11$ .

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Combinatorial Theory Series A 数学-数学

CiteScore

2.90

自引率

9.10%

发文量

审稿时长

12 months

期刊介绍： The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.