|
|||||
|
|
On the minimum average distance of binary constant weight codes |
|
| Authors: | Shu-Tao Xia Fang-Wei Fu |
| Institution: | a The Graduate School at Shenzhen of Tsinghua University, Shenzhen, Guangdong 518055, PR China b National Mobile Communications Research Laboratory, Southeast University, PR China c The Chern Institute of Mathematics and KLPMC, Nankai University, Tianjin 300071, PR China |
| Abstract: | Let β(n,M,w) denote the minimum average Hamming distance of a binary constant weight code with length n, size M and weight w. In this paper, we study the problem of determining β(n,M,w). Using the methods from coding theory and linear programming, we derive several lower bounds on the average Hamming distance of a binary constant weight code. These lower bounds enable us to determine the exact value for β(n,M,w) in several cases. |
| Keywords: | Binary constant weight codes Average distance Distance distribution Johnson scheme Linear programming |
| 本文献已被 ScienceDirect 等数据库收录！ | |