Uniformly Packed Codes and More Distance Regular Graphs from Crooked Functions

  • E. R. VAN DAM edwin. vandam
  • Published 2000


Let V and W be n-dimensional vector spaces over GF(2). A function Q : V → W is called crooked (a notion introduced by Bending and Fon-Der-Flaass) if it satisfies the following three properties: Q(0) = 0; Q(x) + Q(y)+ Q(z)+ Q(x + y + z) 6= 0 for any three distinct x, y, z; Q(x) + Q(y)+ Q(z)+ Q(x + a)+ Q(y + a)+ Q(z + a) 6= 0 if a 6= 0 (x, y, z arbitrary). We… (More)



Citations per Year

Citation Velocity: 4

Averaging 4 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.