Computing the distance distribution of systematic non-linear codes

Details Computing the distance distribution of systematic non-linear codes Computing the distance distribution of systematic non-linear codes

2009-09-09

arxiv.org/abs/0909.1626v1

Computer Science

Discrete Mathematics

Scientific paper

The most important families of non-linear codes are systematic. A brute-force check is the only known method to compute their weight distribution and distance distribution. On the other hand, it outputs also all closest word pairs in the code. In the black-box complexity model, the check is optimal among closest-pair algorithms. In this paper we provide a Groebner basis technique to compute the weight/distance distribution of any systematic non-linear code. Also our technique outputs all closest pairs. Unlike the check, our method can be extended to work on code families.

Affiliated with

Also associated with

No associations

Rating

Computing the distance distribution of systematic non-linear 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 Computing the distance distribution of systematic non-linear codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the distance distribution of systematic non-linear codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-385456