S. Gannon

most citedThe condition for a cyclic code over Z4 of odd length to have a complementary dual

2 citations · 2 across the 1 of their papers we have counts for

collaborators

Showing math.ACShow all

1 paper · 1 filter

math.AC2019

The formula for the largest minimal distance of binary LCD $[n, 2]$ 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 $LCD [n, k]$ was defined for binary LCD $[n, k]$ -codes.…

The formula for the largest minimal distance of binary LCD [n,2] codes

The formula for the largest minimal distance of binary LCD $[n, 2]$ codes