通过在棋盘上放置棋子构造最优的三元等权码

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI:10.1109/ISIT.1998.708649

M. Svanstrom

{"title":"通过在棋盘上放置棋子构造最优的三元等权码","authors":"M. Svanstrom","doi":"10.1109/ISIT.1998.708649","DOIUrl":null,"url":null,"abstract":"We study the problem of constructing optimal ternary constant-weight codes with Hamming weight w and minimum distance d=2w-1. We reformulate the problem as a problem of placing pieces on an M/spl times/M chessboard so that three simple conditions are satisfied. Using this, we construct codes with minimal length for a given number of codewords.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Constructing optimal ternary constant-weight codes by placing pieces on chessboards\",\"authors\":\"M. Svanstrom\",\"doi\":\"10.1109/ISIT.1998.708649\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the problem of constructing optimal ternary constant-weight codes with Hamming weight w and minimum distance d=2w-1. We reformulate the problem as a problem of placing pieces on an M/spl times/M chessboard so that three simple conditions are satisfied. Using this, we construct codes with minimal length for a given number of codewords.\",\"PeriodicalId\":133728,\"journal\":{\"name\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1998.708649\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1998.708649","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

研究了具有汉明权值w和最小距离d=2w-1的最优三元等权码的构造问题。我们将问题重新表述为在M/spl次/M棋盘上放置棋子的问题，从而满足三个简单条件。使用这种方法，我们可以为给定的码字数构造最小长度的码。

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

查看原文本刊更多论文

Constructing optimal ternary constant-weight codes by placing pieces on chessboards

We study the problem of constructing optimal ternary constant-weight codes with Hamming weight w and minimum distance d=2w-1. We reformulate the problem as a problem of placing pieces on an M/spl times/M chessboard so that three simple conditions are satisfied. Using this, we construct codes with minimal length for a given number of codewords.

求助全文

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

来源期刊

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)

自引率

0.00%

发文量