Forms and linear network codes
From MaRDI portal
Publication:2960901
zbMATH Open1384.94125arXiv1303.1626MaRDI QIDQ2960901FDOQ2960901
Authors: Johan P. Hansen 
Publication date: 17 February 2017
Abstract: We present a general theory to obtain linear network codes utilizing forms and obtain explicit families of equidimensional vector spaces, in which any pair of distinct vector spaces intersect in the same small dimension. The theory is inspired by the methods of the author utilizing the osculating spaces of Veronese varieties. 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 introduced a metric on the set af 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 are equidistant in the above metric and the distance between any pair of vector spaces is large making them suitable for linear network coding. The parameters of the resulting linear network codes are determined.
Full work available at URL: https://arxiv.org/abs/1303.1626
Recommendations
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 (6)
- Dimension of intersection space between network code error space and information space
- The metric structure of linear codes
- A note on equidistant subspace codes
- Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety
- Riemann-Roch spaces and linear network codes
- Bilinear forms and linear codes
This page was built for publication: Forms and linear network codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2960901)
