Asymptotically good binary linear codes with asymptotically good self-intersection spans

Details Asymptotically good binary linear codes with asymptotically good self-intersection spans Asymptotically good binary linear codes with asymptotically good self-intersection spans

2012-04-13

arxiv.org/abs/1204.3057v2

Computer Science

Information Theory

14 pages; v1->v2: sign typo fixed

Scientific paper

If C is a binary linear code, let C^2 be the linear code spanned by intersections of pairs of codewords of C. We construct an asymptotically good family of binary linear codes such that, for C ranging in this family, the C^2 also form an asymptotically good family. For this we use algebraic-geometry codes, concatenation, and a fair amount of bilinear algebra. More precisely, the two main ingredients used in our construction are, first, a description of the symmetric square of an odd degree extension field in terms only of field operations of small degree, and second, a recent result of Garcia-Stichtenoth-Bassa-Beelen on the number of points of curves on such an odd degree extension field.

Affiliated with

Also associated with

No associations

Rating

Asymptotically good binary linear codes with asymptotically good self-intersection spans 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 Asymptotically good binary linear codes with asymptotically good self-intersection spans, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotically good binary linear codes with asymptotically good self-intersection spans will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-144593