Dissections and Constant Weight Codes

摘要：

The problem of encoding and decoding binary block codes of length n and constant Hamming weight w is formulated as a polytope dissection problem. This is done by working with a w-dimensional Euclidean space representation for the information and code vectors. Novel algorithms based on two new dissections are presented. The first is a dissection of a subset of the codebook, and has time-complexity o(w).The second is a dissection of the entire codebook, and has time-complexity o(w log w). Implementation issues associated with the second algorithm are discussed in detail.

作者: V.A.Vaishampayan N.J.A.Sloane

作者单位: AT&T Labs-Research, Shannon Laboratory Florham Park, NJ 07932

会议类型: 国际会议

会议名称: 2006年IEEE信息理论国际会议(Proceedings of 2006 IEEE Information Theory Workshop ITW06)

会议地点: 成都

会议语种:英文

页码: 16-20

在线出版日期: 2006-10-22（万方平台首次上网日期，不代表论文的发表时间）