We present a general theory to obtain good linear network codes utilizing the osculating nature of algebraic varieties. In particular, we obtain from the osculating spaces of Veronese varieties explicit families of equidimensional vector spaces, in which any pair of distinct vector spaces intersect in the same dimension. Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possible altered vector space. Ralf Koetter and Frank R. Kschischang [KK08] 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 proposed osculating spaces of Veronese varieties are equidistant in the above metric. The parameters of the resulting linear network codes are determined. © 2013 Springer-Verlag.
CITATION STYLE
Hansen, J. P. (2013). Osculating spaces of varieties and linear network codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8080 LNCS, pp. 83–88). https://doi.org/10.1007/978-3-642-40663-8_9
Mendeley helps you to discover research relevant for your work.