2 citations · 2 across the 1 of their papers we have counts for
2 papers
math.AC2019
The formula for the largest minimal distance of binary LCD codes
Seth Gannon, Hamid Kulosman
In the 2017 paper by Dougherty, Kim, Ozkaya, Sok, and Solé about the linear programming bound for LCD codes the notion was defined for binary LCD -codes.…
math.RA2019★ 2 cited
The condition for a cyclic code over Z4 of odd length to have a complementary dual
Seth Gannon, Hamid Kulosman
We show that a necessary and sufficient condition for a cyclic code C over Z4 of odd length to be an LCD code is that C=(f(x)) where f is a self-reciprocal polynomial in Z4[X].