Any network code comes from an algebraic curve taking osculating spaces

DOI10.1007/S10623-013-9841-4MaRDI QIDQ404953zbMATH OpenOpenAlexFDO

Authors E. Ballico

Publication date 4 September 2014

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

linear network codingalgebraic curveosculating space

Mathematics Subject Classification ID

Plane and space curves (14H50) Projective techniques in algebraic geometry (14N05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: In this note we prove that every network code over $mathbb{F}_q$ may be realized taking some of the osculating spaces of a smooth projective curve.

Cites work

• scientific article; zbMATH DE number 3957109 (Why is no real title available?)
• A Random Linear Network Coding Approach to Multicast
• Algebraic curves over a finite field
• Bertini theorems over finite fields
• Coding for Errors and Erasures in Random Network Coding
• Linear network coding
• Smooth hypersurface sections containing a given subscheme over a finite field
• Which linear codes are algebraic-geometric?
• Wronskians and Plücker formulas for linear systems on curves

Cited in

(2)

• Constant dimension codes from Riemann-Roch spaces
• Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety

This page was built for publication: Any network code comes from an algebraic curve taking osculating spaces

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