Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans

DOI10.1109/TIT.2013.2237944MaRDI QIDQ2989269zbMATH OpenOpenAlexFDO

Authors Hugues Randriam

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1204.3057

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: 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.

Cited in

(9)

• Squares of matrix-product codes
• Yet another variation on minimal linear codes
• On the dimension and structure of the square of the dual of a Goppa code
• Bounded indistinguishability and the complexity of recovering secrets
• Constructions of LCD codes from their Schur products
• A geometric invariant of linear rank-metric codes
• Proving as fast as computing: succinct arguments with constant prover overhead
• Some results on Schur powers and cubes of primitive narrow-sense BCH codes
• High dimensional affine codes whose square has a designed minimum distance

This page was built for publication: Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989269)