Any network code comes from an algebraic curve taking osculating spaces

DOI10.1007/s10623-013-9841-4zbMath1301.14014arXiv1306.0992OpenAlexW2077950613MaRDI QIDQ404953

Edoardo 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

algebraic curveosculating spacelinear network coding

Mathematics Subject Classification ID

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

Related Items (1)

Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety

Cites Work

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

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