Any network code comes from an algebraic curve taking osculating spaces

DOI10.1007/S10623-013-9841-4zbMATH Open1301.14014arXiv1306.0992OpenAlexW2077950613MaRDI QIDQ404953FDOQ404953

Authors: E. Ballico 

Publication date: 4 September 2014

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

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.

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)

Cites Work

• Linear network coding
• Algebraic curves over a finite field
• Bertini theorems over finite fields
• Title not available (Why is that?)
• A Random Linear Network Coding Approach to Multicast
• Coding for Errors and Erasures in Random Network Coding
• Smooth hypersurface sections containing a given subscheme over a finite field
• Wronskians and Plücker formulas for linear systems on curves
• Which linear codes are algebraic-geometric?

Cited In (2)

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

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)