By Topic

Construction of constant weight code and some upper bounds

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
$33 $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

1 Author(s)
Fanxin Zeng ; Graduate Sch., Chongqing Commun. Inst., China

Properties of m-sequence are derived, based on the properties, a family of binary nonlinear constant weight codes is presented, these binary nonlinear constant weight codes can be employed in automatic repeat request (ARQ) communication system. In addition, let Qq (n,d) denote the maximal possible number of codewords in any q-ary equidistant code of length n and Hamming distance d between codewords (with no restriction on weight), let Eq (n,d,w) denote the largest possible number of codewords in any q-ary equidistant code with constant weight, length n, constant weight w, Hamming distance d between codewords. Let q, n, d, w isin N, here N denotes natural number set. We show that 1) Eq (n,d,w) les qn, 2) Qq (n,d) les qn+1, when q > 2, and if q=2, then 3) Eq (n,d,w) les n, 4) Qq (n,d) les n+1

Published in:

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

Date of Conference:

4-9 Sept. 2005