Quaternary Constant-Composition Codes with Weight Four and Distances Five or Six

Details Quaternary Constant-Composition Codes with Weight Four and Distances Five or Six Quaternary Constant-Composition Codes with Weight Four and Distances Five or Six

2012-02-29

arxiv.org/abs/1202.6447v4

Computer Science

Information Theory

23 pages, 3 tables

Scientific paper

The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal quaternary constant-composition codes with Hamming weight four and minimum distances five or six through group divisible codes and Room square approaches. The problem is solved leaving only five lengths undetermined. Previously, the results on the sizes of such quaternary constant-composition codes were scarce.

Affiliated with

Also associated with

No associations

Rating

Quaternary Constant-Composition Codes with Weight Four and Distances Five or Six 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 Quaternary Constant-Composition Codes with Weight Four and Distances Five or Six, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quaternary Constant-Composition Codes with Weight Four and Distances Five or Six will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-523520