An algebraic-coding equivalence to the maximum distance separable conjecture
Copyright policy )An algebraic-coding equivalence to the maximum distance separable conjecture
In this paper, we provide Algebraic-Coding necessary and sufficient conditions for the Maximum Distance Separable Conjecture to hold.
Involve, to appear. arXiv admin note: text overlap with arXiv:1611.02354
Mathematics - Number Theory, Blocking sets, ovals, \(k\)-arcs, 94B05, 05B35, 12Y05, maximum distance separable (MDS) conjecture, projective spaces, arcs, linear independence, FOS: Mathematics, Number Theory (math.NT), coding theory, Linear codes (general theory), Combinatorial aspects of matrices (incidence, Hadamard, etc.), algebraic geometry
Mathematics - Number Theory, Blocking sets, ovals, \(k\)-arcs, 94B05, 05B35, 12Y05, maximum distance separable (MDS) conjecture, projective spaces, arcs, linear independence, FOS: Mathematics, Number Theory (math.NT), coding theory, Linear codes (general theory), Combinatorial aspects of matrices (incidence, Hadamard, etc.), algebraic geometry
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!