A short proof that all linear codes are weakly algebraic-geometric using Bertini theorems of B. Poonen

DOI10.1016/J.DISC.2020.111851zbMATH Open1448.94275arXiv1303.3341OpenAlexW3008457931MaRDI QIDQ2174595FDOQ2174595

Authors: Srimathy Srinivasan 

Publication date: 21 April 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: In this paper we give a simpler proof of a deep theorem proved by Pellikan, Shen and van Wee that all linear codes are weakly algebraic-geometric using a theorem of B.Poonen.

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

Recommendations

• Which linear codes are algebraic-geometric?
• scientific article; zbMATH DE number 107496
• Algebraic geometry codes: general theory
• scientific article; zbMATH DE number 1795249
• Algebraic geometric codes with applications

zbMATH Keywords

linear codesBertini theorems over finite fieldsweakly algebraic-geometric codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cites Work

• Bertini theorems over finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Smooth hypersurface sections containing a given subscheme over a finite field
• Title not available (Why is that?)
• Which linear codes are algebraic-geometric?
• Differential approach for the study of duals of algebraic-geometric codes on surfaces

This page was built for publication: A short proof that all linear codes are weakly algebraic-geometric using Bertini theorems of B. Poonen

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