Riemann-Roch spaces and linear network codes

zbMATH Open1384.94124arXiv1503.02386MaRDI QIDQ2960874FDOQ2960874

Authors: Johan P. Hansen 

Publication date: 17 February 2017

Abstract: We construct linear network codes utilizing algebraic curves over finite fields and certain associated Riemann-Roch spaces and present methods to obtain their parameters. In particular we treat the Hermitian curve and the curves associated with the Suzuki and Ree groups all having the maximal number of points for curves of their respective genera. Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possibly altered vector space. Ralf Koetter and Frank R. Kschischang %cite{DBLP:journals/tit/KoetterK08} introduced a metric on the set of vector spaces and showed that a minimal distance decoder for this metric achieves correct decoding if the dimension of the intersection of the transmitted and received vector space is sufficiently large. The vector spaces in our construction have minimal distance bounded from below in the above metric making them suitable for linear network coding.

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

Recommendations

• Constant dimension codes from Riemann-Roch spaces
• Forms and linear network codes
• Riemann-Roch spaces of the Hermitian function field with applications to algebraic geometry codes and low-discrepancy sequences
• Osculating Spaces of Varieties and Linear Network Codes
• Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety

zbMATH Keywords

linear network codesRiemann-Roch theorem for curves

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cited In (7)

• Osculating Spaces of Varieties and Linear Network Codes
• Riemann-Roch spaces of the Hermitian function field with applications to algebraic geometry codes and low-discrepancy sequences
• Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety
• Constant dimension codes from Riemann-Roch spaces
• Linear network codes based on \(R\)-modules
• Forms and linear network codes
• Sheaf cohomology on network codings: maxflow-mincut theorem

This page was built for publication: Riemann-Roch spaces and linear network codes

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