29 citations · 46 across the 11 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2016★ 4 cited
Harder-Narasimhan theory for linear codes
Hugues Randriambololona
In this text we develop some aspects of Harder-Narasimhan theory, slopes, semistability and canonical filtration, in the setting of combinatorial lattices. Of noticeable importance…
math.CO2010
(2,1)-separating systems beyond the probabilistic bound
Hugues Randriambololona
Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, altho…