Mathematics – Combinatorics
Scientific paper
2007-06-08
Mathematics
Combinatorics
9 pages, 6 figures
Scientific paper
We present a novel technique for encoding and decoding constant weight binary codes that uses a geometric interpretation of the codebook. Our technique is based on embedding the codebook in a Euclidean space of dimension equal to the weight of the code. The encoder and decoder mappings are then interpreted as a bijection between a certain hyper-rectangle and a polytope in this Euclidean space. An inductive dissection algorithm is developed for constructing such a bijection. We prove that the algorithm is correct and then analyze its complexity. The complexity depends on the weight of the code, rather than on the block length as in other algorithms. This approach is advantageous when the weight is smaller than the square root of the block length.
Sloane N. J. A.
Tian Chao
Vaishampayan Vinay A.
No associations
LandOfFree
Constant Weight Codes: A Geometric Approach Based on Dissections does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Constant Weight Codes: A Geometric Approach Based on Dissections, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constant Weight Codes: A Geometric Approach Based on Dissections will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-653345