Z2Z4-linear codes: rank and kernel

Details Z2Z4-linear codes: rank and kernel Z2Z4-linear codes: rank and kernel

2008-07-26

arxiv.org/abs/0807.4247v2

Computer Science

Information Theory

Scientific paper

A code C is Z2Z4-additive if the set of coordinates can be partitioned into two subsets X and Y such that the punctured code of C by deleting the coordinates outside X (respectively, Y) is a binary linear code (respectively, a quaternary linear code). In this paper, the rank and dimension of the kernel for Z2Z4-linear codes, which are the corresponding binary codes of Z2Z4-additive codes, are studied. The possible values of these two parameters for Z2Z4-linear codes, giving lower and upper bounds, are established. For each possible rank r between these bounds, the construction of a Z2Z4-linear code with rank r is given. Equivalently, for each possible dimension of the kernel k, the construction of a Z2Z4-linear code with dimension of the kernel k is given. Finally, the bounds on the rank, once the kernel dimension is fixed, are established and the construction of a Z2Z4-additive code for each possible pair (r,k) is given.

Affiliated with

Also associated with

No associations

Rating

Z2Z4-linear codes: rank and kernel 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 Z2Z4-linear codes: rank and kernel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Z2Z4-linear codes: rank and kernel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-314696