A Construction for Constant-Composition Codes

Details A Construction for Constant-Composition Codes A Construction for Constant-Composition Codes

2008-02-13

arxiv.org/abs/0802.1815v1

Computer Science

Information Theory

4 pages, submitted to IEEE Infromation Theory

Scientific paper

By employing the residue polynomials, a construction of constant-composition codes is given. This construction generalizes the one proposed by Xing[16]. It turns out that when d=3 this construction gives a lower bound of constant-composition codes improving the one in [10]. Moreover, for d>3, we give a lower bound on maximal size of constant-composition codes. In particular, our bound for d=5 gives the best possible size of constant-composition codes up to magnitude.

Affiliated with

Also associated with

No associations

Rating

A Construction for Constant-Composition Codes 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 A Construction for Constant-Composition Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Construction for Constant-Composition Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-676719