Cart (Loading....) | Create Account
Close category search window

Dissections and Constant Weight Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Vaishampayan, V.A. ; Shannon Lab., AT&T Labs-Res., NJ ; Sloane, N.

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

Published in:

Information Theory Workshop, 2006. ITW '06 Chengdu. IEEE

Date of Conference:

22-26 Oct. 2006

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.