李氏码大小的界限

2013 8th International Symposium on Image and Signal Processing and Analysis (ISPA) Pub Date : 2013-09-01 DOI:10.1109/ISPA.2013.6703787

Helena Astola, I. Tabus

{"title":"李氏码大小的界限","authors":"Helena Astola, I. Tabus","doi":"10.1109/ISPA.2013.6703787","DOIUrl":null,"url":null,"abstract":"Finding the largest code with a given minimum distance is one of the most basic problems in coding theory. In this paper, we compute new upper bounds on size of codes in the Lee metric using the linear programming method. We present a recursive formula for obtaining the Lee-numbers, which makes it possible to efficiently compute these bounds. The obtained bounds are useful in determining whether good codes suitable for signal processing applications exist with given parameters.","PeriodicalId":425029,"journal":{"name":"2013 8th International Symposium on Image and Signal Processing and Analysis (ISPA)","volume":"193 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Bounds on the size of Lee-codes\",\"authors\":\"Helena Astola, I. Tabus\",\"doi\":\"10.1109/ISPA.2013.6703787\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Finding the largest code with a given minimum distance is one of the most basic problems in coding theory. In this paper, we compute new upper bounds on size of codes in the Lee metric using the linear programming method. We present a recursive formula for obtaining the Lee-numbers, which makes it possible to efficiently compute these bounds. The obtained bounds are useful in determining whether good codes suitable for signal processing applications exist with given parameters.\",\"PeriodicalId\":425029,\"journal\":{\"name\":\"2013 8th International Symposium on Image and Signal Processing and Analysis (ISPA)\",\"volume\":\"193 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 8th International Symposium on Image and Signal Processing and Analysis (ISPA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPA.2013.6703787\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 8th International Symposium on Image and Signal Processing and Analysis (ISPA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPA.2013.6703787","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

在给定最小距离下求最大码是编码理论中最基本的问题之一。本文用线性规划的方法计算了李度量中码的大小的上界。我们提出了一个求李氏数的递归公式，使得有效地计算这些边界成为可能。所得的边界对于确定给定参数下是否存在适合信号处理应用的良好码是有用的。

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

查看原文本刊更多论文

Bounds on the size of Lee-codes

Finding the largest code with a given minimum distance is one of the most basic problems in coding theory. In this paper, we compute new upper bounds on size of codes in the Lee metric using the linear programming method. We present a recursive formula for obtaining the Lee-numbers, which makes it possible to efficiently compute these bounds. The obtained bounds are useful in determining whether good codes suitable for signal processing applications exist with given parameters.

求助全文

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

来源期刊

2013 8th International Symposium on Image and Signal Processing and Analysis (ISPA)

自引率

0.00%

发文量