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

被引：1
|
作者：
Svanstrom, M [1 ]
机构：
[1] Linkoping Univ, Dept Elect Engn, S-58183 Linkoping, Sweden
来源：
1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS | 1998年
关键词：
D O I：
10.1109/ISIT.1998.708649
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
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 x M chessboard so that three simple conditions are satisfied. Using this, we construct codes with minimal length for a given number of codewords.
引用
收藏
页码：66 / 66
页数：1
相关论文
共 50 条
12345