is a binary linear code, let be the linear code spanned by intersections of pairs of codewords of . We construct an asymptotically good family of binary linear codes such that, for ranging in this family, 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.
The existence, over every finite field, of asymptotically good families 1 of codes whose squares also form an asymptotically good family was established in REF .
Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Computer Science Mathematics