most citedSome combinatorial aspects of constructing bipartite-graph codes

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

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2009

Linear nonbinary covering codes and saturating sets in projective spaces

Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini +1

Let A_{R,q} denote a family of covering codes, in which the covering radius R and the size q of the underlying Galois field are fixed, while the code length tends to infinity. In t…

math.CO2009

New inductive constructions of complete caps in , even

Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini +1

Some new families of small complete caps in , even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective s…