good covering codes from algebraic curves · good covering codes from algebraic curves massimo...

168
Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra and Number Theory Workshop 2: Algebraic curves over finite fields Linz, 14 November 2013

Upload: others

Post on 25-Jul-2020

9 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

Good covering codes from algebraic curves

Massimo Giulietti

University of Perugia (Italy)

Special Semester on Applications of Algebra and Number TheoryWorkshop 2: Algebraic curves over finite fields

Linz, 14 November 2013

Page 2: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

covering codes

(Fnq , d) d Hamming distance C ⊂ F

nq

Page 3: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

covering codes

(Fnq , d) d Hamming distance C ⊂ F

nq

covering radius of C

R(C ) := maxv∈Fn

q

d(v ,C )

Page 4: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

covering codes

(Fnq , d) d Hamming distance C ⊂ F

nq

covering radius of C

R(C ) := maxv∈Fn

q

d(v ,C )

b

bb

bR

Fnq

Page 5: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

covering codes

(Fnq , d) d Hamming distance C ⊂ F

nq

covering radius of C

R(C ) := maxv∈Fn

q

d(v ,C )

b

bb

bR

Fnq

b

v

covering density of C

µ(C ) := #C · size of a sphere of radius R(C )

qn

Page 6: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

covering codes

(Fnq , d) d Hamming distance C ⊂ F

nq

covering radius of C

R(C ) := maxv∈Fn

q

d(v ,C )

b

bb

bR

Fnq

b

v

covering density of C

µ(C ) := #C · size of a sphere of radius R(C )

qn≥ 1

Page 7: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

linear codes

k = dimC r = n − k

µ(C ) =1 + n(q − 1) +

(n2

)(q − 1)2 + . . .+

(n

R(C)

)(q − 1)R(C)

qr

Page 8: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

linear codes

k = dimC r = n − k

µ(C ) =1 + n(q − 1) +

(n2

)(q − 1)2 + . . .+

(n

R(C)

)(q − 1)R(C)

qr

ℓ(r , q)R := min n for which there exists C ⊂ Fnq with

R(C ) = R , n − dim(C ) = r

Page 9: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

linear codes

k = dimC r = n − k

µ(C ) =1 + n(q − 1) +

(n2

)(q − 1)2 + . . .+

(n

R(C)

)(q − 1)R(C)

qr

ℓ(r , q)R,d := min n for which there exists C ⊂ Fnq with

R(C ) = R , n − dim(C ) = r , d(C ) = d

Page 10: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

linear codes

k = dimC r = n − k

µ(C ) =1 + n(q − 1) +

(n2

)(q − 1)2 + . . .+

(n

R(C)

)(q − 1)R(C)

qr

ℓ(r , q)R,d := min n for which there exists C ⊂ Fnq with

R(C ) = R , n − dim(C ) = r , d(C ) = d

R = 2, d = 4 (quasi-perfect codes)

R = r − 1, d = r + 1 (MDS codes)

q odd

Page 11: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

ℓ(3, q)2,4

Page 12: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

in geometrical terms...

Σ = Σ(2, q)

Galois plane over the finite field Fq

Σ

Page 13: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

in geometrical terms...

Σ = Σ(2, q)

Galois plane over the finite field Fq

b

b

b

b

b

b

b

b

bb

b

b

b S

Σ

S ⊂ Σ is a saturating set if every point in Σ \ S is collinear with twopoints in S

Page 14: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

in geometrical terms...

Σ = Σ(2, q)

Galois plane over the finite field Fq

b

b

b

b

b

b

b

b

bb

b

b

b Sb

Σ

S ⊂ Σ is a saturating set if every point in Σ \ S is collinear with twopoints in S

Page 15: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

in geometrical terms...

Σ = Σ(2, q)

Galois plane over the finite field Fq

b

b

b

b

b

b

b

b

bb

b

b

b Sb

Σ

S ⊂ Σ is a saturating set if every point in Σ \ S is collinear with twopoints in S

Page 16: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

in geometrical terms...

Σ = Σ(2, q)

Galois plane over the finite field Fq

b

b

b

b

b

b

b

b

bb

b

b

b Sb

Σ

S ⊂ Σ is a saturating set if every point in Σ \ S is collinear with twopoints in S

Page 17: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

in geometrical terms...

Σ = Σ(2, q)

Galois plane over the finite field Fq

b

b

b

b

b

b

b

b

bb

b

b

b Sb

Σ

S ⊂ Σ is a saturating set if every point in Σ \ S is collinear with twopoints in S

a complete cap is a saturating set which does not contain 3 collinearpoints

Page 18: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

in geometrical terms...

Σ = Σ(2, q)

Galois plane over the finite field Fq

b

b

b

b

b

b

b

b

bb

b

b

b Sb

Σ

S ⊂ Σ is a saturating set if every point in Σ \ S is collinear with twopoints in S

a complete cap is a saturating set which does not contain 3 collinearpoints

ℓ(3, q)2,4 = minimum size of a complete cap in P2(Fq)

Page 19: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

plane complete caps

TLB:#S >

2q + 1

Page 20: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

plane complete caps

TLB:#S >

2q + 1

in P2(Fq) there exists a complete cap S of size

#S ≤ D√q logC q

(Kim-Vu, 2003)

Page 21: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

plane complete caps

TLB:#S >

2q + 1

in P2(Fq) there exists a complete cap S of size

#S ≤ D√q logC q

(Kim-Vu, 2003)

for every q prime q < 67000 there exists a complete cap S of size

#S ≤ √q log q

(Bartoli-Davydov-Faina-Marcugini-Pambianco, 2012)

Page 22: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

plane complete caps

TLB:#S >

2q + 1

in P2(Fq) there exists a complete cap S of size

#S ≤ D√q logC q

(Kim-Vu, 2003)

for every q prime q < 67000 there exists a complete cap S of size

#S ≤ √q log q

(Bartoli-Davydov-Faina-Marcugini-Pambianco, 2012)

Page 23: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

naive construction method:

Page 24: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

naive construction method:

S = {P1, P2,

b

b

P1

P2

Page 25: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

naive construction method:

S = {P1, P2, P3,

b

b

P1

P2

b P3

Page 26: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

naive construction method:

S = {P1, P2, P3, P4,

b

b

P1

P2

b P3

b

P4

Page 27: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

naive construction method:

S = {P1, P2, P3, P4, . . . ,

b

b

P1

P2

b P3

b

P4 b

b

b

b

b

b

bb

b

b

b

b

Page 28: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

naive construction method:

S = {P1, P2, P3, P4, . . . , Pn}

b

b

P1

P2

b P3

b

P4 b

b

b

b

b

b

bb

b

b

b

b

naive vs. theoretical

Page 29: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

0

500

1000

1500

2000

0

← Naive algorithm

20000 40000 60000 80000 100000q

Page 30: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

0

500

1000

1500

2000

0 20000 40000 60000 80000 100000q

√q · (log q)0.75 →

← Naive algorithm

TLB

√3q + 1/2

Page 31: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

cubic curvesX plane irreducible cubic curve

Page 32: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

cubic curvesX plane irreducible cubic curve

• Q• P

G = X (Fq) \ Sing(X )

•P ⊕ Q

T

O•

if O is an inflection point of X , then P , Q, T ∈ G are collinear ifand only if

P ⊕ Q ⊕ T = O

Page 33: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

cubic curvesX plane irreducible cubic curve

• Q• P

G = X (Fq) \ Sing(X )

•P ⊕ Q

T

O•

if O is an inflection point of X , then P , Q, T ∈ G are collinear ifand only if

P ⊕ Q ⊕ T = O

for a subgroup K of index m with (3,m) = 1, no 3 points in a coset

S = K ⊕ Q, Q /∈ K

are collinear

Page 34: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

classification (p > 3)

Page 35: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

classification (p > 3)

Page 36: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

classification (p > 3)

Page 37: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

classification (p > 3)

Page 38: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

classification (p > 3)

Y = X 3 XY = (X − 1)3

Y (X 2 − β) = 1 Y 2 = X 3 + AX + B

Page 39: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

how to prove completeness?

S parametrized by polynomials defined over Fq

S = {(f (t), g(t)) | t ∈ Fq} ⊂ A2(Fq)

Page 40: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

how to prove completeness?

S parametrized by polynomials defined over Fq

S = {(f (t), g(t)) | t ∈ Fq} ⊂ A2(Fq)

P = (a, b) collinear with two points in S if there exist x , y ∈ Fq with

det

a b 1f (x) g(x) 1f (y) g(y) 1

= 0

Page 41: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

how to prove completeness?

S parametrized by polynomials defined over Fq

S = {(f (t), g(t)) | t ∈ Fq} ⊂ A2(Fq)

P = (a, b) collinear with two points in S if there exist x , y ∈ Fq withFa,b(x , y) = 0, where

Fa,b(x , y) := det

a b 1f (x) g(x) 1f (y) g(y) 1

Page 42: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

how to prove completeness?

S parametrized by polynomials defined over Fq

S = {(f (t), g(t)) | t ∈ Fq} ⊂ A2(Fq)

P = (a, b) collinear with two points in S if there exist x , y ∈ Fq withFa,b(x , y) = 0, where

Fa,b(x , y) := det

a b 1f (x) g(x) 1f (y) g(y) 1

P = (a, b) collinear with two points in S if the algebraic curve

CP : Fa,b(X ,Y ) = 0

has a suitable Fq-rational point (x , y)

Page 43: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

how to prove completeness?

S parametrized by polynomials defined over Fq

S = {(f (t), g(t)) | t ∈ Fq} ⊂ A2(Fq)

P = (a, b) collinear with two points in S if there exist x , y ∈ Fq withFa,b(x , y) = 0, where

Fa,b(x , y) := det

a b 1f (x) g(x) 1f (y) g(y) 1

P = (a, b) collinear with two points in S if the algebraic curve

CP : Fa,b(X ,Y ) = 0

has a suitable Fq-rational point (x , y)

Page 44: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

cuspidal case: Y = X 3

G is an elementary abelian p-group q = ph

Page 45: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

cuspidal case: Y = X 3

G is an elementary abelian p-group q = ph

K = {(tp − t, (tp − t)3) | t ∈ Fq}

Page 46: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

cuspidal case: Y = X 3

G is an elementary abelian p-group q = ph

K = {(tp − t, (tp − t)3) | t ∈ Fq}

S = {(f (t)

︷ ︸︸ ︷

tp − t + t, (

g(t)︷ ︸︸ ︷

tp − t + t)3)︸ ︷︷ ︸

Pt

| t ∈ Fq}

Page 47: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

cuspidal case: Y = X 3

G is an elementary abelian p-group q = ph

K = {(tp − t, (tp − t)3) | t ∈ Fq}

S = {(f (t)

︷ ︸︸ ︷

tp − t + t, (

g(t)︷ ︸︸ ︷

tp − t + t)3)︸ ︷︷ ︸

Pt

| t ∈ Fq}

P = (a, b) is collinear with Px and Py if and only if

Fa,b(x , y) := a + (xp − x + t)(yp − y + t)2 +

(xp − x + t)2(yp − y + t)− b((xp − x + t)2

+(xp − x + t)(yp − y + t) + (yp − y + t)2) = 0

Page 48: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

cuspidal case: Y = X 3

G is an elementary abelian p-group q = ph

K = {(tp − t, (tp − t)3) | t ∈ Fq}

S = {(f (t)

︷ ︸︸ ︷

tp − t + t, (

g(t)︷ ︸︸ ︷

tp − t + t)3)︸ ︷︷ ︸

Pt

| t ∈ Fq}

P = (a, b) is collinear with Px and Py if and only if

Fa,b(x , y) := a + (xp − x + t)(yp − y + t)2 +

(xp − x + t)2(yp − y + t)− b((xp − x + t)2

+(xp − x + t)(yp − y + t) + (yp − y + t)2) = 0

the curve CP then is Fa,b(X ,Y ) = 0

Page 49: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

applying Segre’s criterion

(Segre, 1962)

if there exists a point P ∈ C and a tangent ℓ of C at P such that

ℓ counts once among the tangents of C at P ,the intersection multiplicity of C and ℓ at P equals deg(C),C has no linear components through P ,

then C is irreducible.

Page 50: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

applying Segre’s criterion

(Segre, 1962)

if there exists a point P ∈ C and a tangent ℓ of C at P such that

ℓ counts once among the tangents of C at P ,the intersection multiplicity of C and ℓ at P equals deg(C),C has no linear components through P ,

then C is irreducible.

Fa,b(X ,Y ) := a+ (X p − X + t)(Y p − Y + t)2 +

(X p − X + t)2(Y p − Y + t)− b((X p − X + t)2

+(X p − X + t)(Y p − Y + t) + (Y p − Y + t)2) = 0

Page 51: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

applying Segre’s criterion

(Segre, 1962)

if there exists a point P ∈ C and a tangent ℓ of C at P such that

ℓ counts once among the tangents of C at P ,the intersection multiplicity of C and ℓ at P equals deg(C),C has no linear components through P ,

then C is irreducible.

Fa,b(X ,Y ) := a+ (X p − X + t)(Y p − Y + t)2 +

(X p − X + t)2(Y p − Y + t)− b((X p − X + t)2

+(X p − X + t)(Y p − Y + t) + (Y p − Y + t)2) = 0

at P = X∞ the tangents are ℓ : Y = β with βp − β + t = b

Page 52: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

applying Segre’s criterion

(Segre, 1962)

if there exists a point P ∈ C and a tangent ℓ of C at P such that

ℓ counts once among the tangents of C at P ,the intersection multiplicity of C and ℓ at P equals deg(C),C has no linear components through P ,

then C is irreducible.

Fa,b(X ,Y ) := a+ (X p − X + t)(Y p − Y + t)2 +

(X p − X + t)2(Y p − Y + t)− b((X p − X + t)2

+(X p − X + t)(Y p − Y + t) + (Y p − Y + t)2) = 0

at P = X∞ the tangents are ℓ : Y = β with βp − β + t = b

Fa,b(X , β) = a− b3

Page 53: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

applying Segre’s criterion

(Segre, 1962)

if there exists a point P ∈ C and a tangent ℓ of C at P such that

ℓ counts once among the tangents of C at P ,the intersection multiplicity of C and ℓ at P equals deg(C),C has no linear components through P ,

then C is irreducible.

Fa,b(X ,Y ) := a+ (X p − X + t)(Y p − Y + t)2 +

(X p − X + t)2(Y p − Y + t)− b((X p − X + t)2

+(X p − X + t)(Y p − Y + t) + (Y p − Y + t)2) = 0

at P = X∞ the tangents are ℓ : Y = β with βp − β + t = b

Fa,b(X , β) = a− b3if P /∈ XCP is irreducible of genus g ≤ 3p2 − 3p + 1

Page 54: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

applying Segre’s criterion

(Segre, 1962)

if there exists a point P ∈ C and a tangent ℓ of C at P such that

ℓ counts once among the tangents of C at P ,the intersection multiplicity of C and ℓ at P equals deg(C),C has no linear components through P ,

then C is irreducible.

Fa,b(X ,Y ) := a+ (X p − X + t)(Y p − Y + t)2 +

(X p − X + t)2(Y p − Y + t)− b((X p − X + t)2

+(X p − X + t)(Y p − Y + t) + (Y p − Y + t)2) = 0

at P = X∞ the tangents are ℓ : Y = β with βp − β + t = b

Fa,b(X , β) = a− b3if P /∈ XCP is irreducible of genus g ≤ 3p2 − 3p + 1

CP has at least q + 1− (6p2 − 6p + 2)√q points

Page 55: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

cuspidal case: Y = X 3

G is elementary abelian, isomorphic to (Fq ,+)

Page 56: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

cuspidal case: Y = X 3

G is elementary abelian, isomorphic to (Fq ,+)

S = {(L(t) + t, (L(t) + t)3)︸ ︷︷ ︸

Pt

| t ∈ Fq}

L(T ) =∏

α∈M

(T − α), M < (Fq,+), #M = m

Page 57: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

cuspidal case: Y = X 3

G is elementary abelian, isomorphic to (Fq ,+)

S = {(L(t) + t, (L(t) + t)3)︸ ︷︷ ︸

Pt

| t ∈ Fq}

L(T ) =∏

α∈M

(T − α), M < (Fq,+), #M = m

P = (a, b) is collinear with Px and Py if and only if

Fa,b(x , y) := a+ (L(x) + t)(L(y) + t)2 +

(L(x) + t)2(L(y) + t)− b((L(x) + t)2

+(L(x) + t)(L(y) + t) + (L(y) + t)2) = 0

Page 58: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

cuspidal case: Y = X 3

G is elementary abelian, isomorphic to (Fq ,+)

S = {(L(t) + t, (L(t) + t)3)︸ ︷︷ ︸

Pt

| t ∈ Fq}

L(T ) =∏

α∈M

(T − α), M < (Fq,+), #M = m

P = (a, b) is collinear with Px and Py if and only if

Fa,b(x , y) := a+ (L(x) + t)(L(y) + t)2 +

(L(x) + t)2(L(y) + t)− b((L(x) + t)2

+(L(x) + t)(L(y) + t) + (L(y) + t)2) = 0

if P /∈ XCP is irreducible of genus g ≤ 3m2 − 3m + 1

Page 59: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

cuspidal case: Y = X 3

G is elementary abelian, isomorphic to (Fq ,+)

S = {(L(t) + t, (L(t) + t)3)︸ ︷︷ ︸

Pt

| t ∈ Fq}

L(T ) =∏

α∈M

(T − α), M < (Fq,+), #M = m

P = (a, b) is collinear with Px and Py if and only if

Fa,b(x , y) := a+ (L(x) + t)(L(y) + t)2 +

(L(x) + t)2(L(y) + t)− b((L(x) + t)2

+(L(x) + t)(L(y) + t) + (L(y) + t)2) = 0

if P /∈ XCP is irreducible of genus g ≤ 3m2 − 3m + 1

CP has at least q + 1− (6m2 − 6m + 2)√q points

Page 60: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Szonyi, 1985 - Anbar, Bartoli, G., Platoni, 2013)

let P = (a, b) be a point in A2(Fq) \ X ; if

m < 4√

q/36

then there is a secant of S passing through P .

Page 61: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Szonyi, 1985 - Anbar, Bartoli, G., Platoni, 2013)

let P = (a, b) be a point in A2(Fq) \ X ; if

m < 4√

q/36

then there is a secant of S passing through P .

m is a power of p

Page 62: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Szonyi, 1985 - Anbar, Bartoli, G., Platoni, 2013)

let P = (a, b) be a point in A2(Fq) \ X ; if

m < 4√

q/36

then there is a secant of S passing through P .

m is a power of p

the points in X \ S need to be dealt with

Page 63: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Szonyi, 1985 - Anbar, Bartoli, G., Platoni, 2013)

let P = (a, b) be a point in A2(Fq) \ X ; if

m < 4√

q/36

then there is a secant of S passing through P .

m is a power of p

the points in X \ S need to be dealt with

theorem

if m < 4√

q/36, then there exists a complete cap in A2(Fq) with size

m +q

m− 3

Page 64: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Szonyi, 1985 - Anbar, Bartoli, G., Platoni, 2013)

let P = (a, b) be a point in A2(Fq) \ X ; if

m < 4√

q/36

then there is a secant of S passing through P .

m is a power of p

the points in X \ S need to be dealt with

theorem

if m < 4√

q/36, then there exists a complete cap in A2(Fq) with size

m +q

m− 3 ∼ p1/4 · q3/4

Page 65: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

nodal case: XY = (X − 1)3

G is isomorphic to (F∗q, ·)

G → F∗q

(

v ,(v − 1)3

v

)

7→ v

Page 66: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

nodal case: XY = (X − 1)3

G is isomorphic to (F∗q, ·)

G → F∗q

(

v ,(v − 1)3

v

)

7→ v

the subgroup of index m (m a divisor of q − 1):

K ={(

tm,(tm − 1)3

tm

)| t ∈ F

∗q

}

Page 67: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

nodal case: XY = (X − 1)3

G is isomorphic to (F∗q, ·)

G → F∗q

(

v ,(v − 1)3

v

)

7→ v

the subgroup of index m (m a divisor of q − 1):

K ={(

tm,(tm − 1)3

tm

)| t ∈ F

∗q

}

a coset:

S ={(

ttm,(t tm − 1)3

ttm

)

| t ∈ F∗q

}

Page 68: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

nodal case: XY = (X − 1)3

G is isomorphic to (F∗q, ·)

G → F∗q

(

v ,(v − 1)3

v

)

7→ v

the subgroup of index m (m a divisor of q − 1):

K ={(

tm,(tm − 1)3

tm

)| t ∈ F

∗q

}

a coset:

S ={(

f (t)︷︸︸︷

ttm ,

g(t)︷ ︸︸ ︷

(ttm − 1)3

ttm

)

︸ ︷︷ ︸

Pt

| t ∈ F∗q

}

Page 69: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

nodal case: XY = (X − 1)3

G is isomorphic to (F∗q, ·)

G → F∗q

(

v ,(v − 1)3

v

)

7→ v

the subgroup of index m (m a divisor of q − 1):

K ={(

tm,(tm − 1)3

tm

)| t ∈ F

∗q

}

a coset:

S ={(

f (t)︷︸︸︷

ttm ,

g(t)︷ ︸︸ ︷

(ttm − 1)3

ttm

)

︸ ︷︷ ︸

Pt

| t ∈ F∗q

}

the curve CP :Fa,b(X ,Y ) = a(t3X 2mYm + t3XmY 2m − 3t2XmYm + 1)

−bt2XmYm − t4X 2mY 2m + 3t2XmYm

−tXm − tYm = 0

Page 70: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Anbar-Bartoli-G.-Platoni, 2013)

let P be a point in A2(Fq) \ X ; if

m < 4√

q/36

then there is a secant of S passing through P

Page 71: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Anbar-Bartoli-G.-Platoni, 2013)

let P be a point in A2(Fq) \ X ; if

m < 4√

q/36

then there is a secant of S passing through P

m is a divisor of q − 1

Page 72: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Anbar-Bartoli-G.-Platoni, 2013)

let P be a point in A2(Fq) \ X ; if

m < 4√

q/36

then there is a secant of S passing through P

m is a divisor of q − 1

some points from X \ S need to be added to S

Page 73: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Anbar-Bartoli-G.-Platoni, 2013)

let P be a point in A2(Fq) \ X ; if

m < 4√

q/36

then there is a secant of S passing through P

m is a divisor of q − 1

some points from X \ S need to be added to S

theorem

if m is a divisor of q − 1 with m < 4√

q/36, and in addition (m, q−1m

) = 1,then there exists a complete cap in A

2(Fq) with size

m +q − 1

m− 3

Page 74: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Anbar-Bartoli-G.-Platoni, 2013)

let P be a point in A2(Fq) \ X ; if

m < 4√

q/36

then there is a secant of S passing through P

m is a divisor of q − 1

some points from X \ S need to be added to S

theorem

if m is a divisor of q − 1 with m < 4√

q/36, and in addition (m, q−1m

) = 1,then there exists a complete cap in A

2(Fq) with size

m +q − 1

m− 3 ∼ q3/4

Page 75: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

isolated double point case: Y (X 2 − β) = 1

G cyclic of order q + 1

Page 76: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

isolated double point case: Y (X 2 − β) = 1

G cyclic of order q + 1

(Anbar-Bartoli-G.-Platoni, 2013)

if m is a divisor of q + 1 with m < 4√

q/36, and in addition (m, q+1m

) = 1,then there exists a complete cap in A

2(Fq) with size at most

m +q + 1

m

Page 77: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

isolated double point case: Y (X 2 − β) = 1

G cyclic of order q + 1

(Anbar-Bartoli-G.-Platoni, 2013)

if m is a divisor of q + 1 with m < 4√

q/36, and in addition (m, q+1m

) = 1,then there exists a complete cap in A

2(Fq) with size at most

m +q + 1

m∼ q3/4

Page 78: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case: Y 2 = X 3 + AX + B

ifn ∈ [q + 1− 2

√q, q + 1 + 2

√q] n 6≡ q + 1 (mod p)

there exists an elliptic cubic curve X over Fq with #G = n

Page 79: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case: Y 2 = X 3 + AX + B

ifn ∈ [q + 1− 2

√q, q + 1 + 2

√q] n 6≡ q + 1 (mod p)

there exists an elliptic cubic curve X over Fq with #G = n

(Voloch, 1988)

if p does not divide #G − 1, then G can be assumed to be cyclic

Page 80: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case: Y 2 = X 3 + AX + B

ifn ∈ [q + 1− 2

√q, q + 1 + 2

√q] n 6≡ q + 1 (mod p)

there exists an elliptic cubic curve X over Fq with #G = n

(Voloch, 1988)

if p does not divide #G − 1, then G can be assumed to be cyclic

problem: no polynomial or rational parametrization of the points ofS is possible

Page 81: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case: Y 2 = X 3 + AX + B

ifn ∈ [q + 1− 2

√q, q + 1 + 2

√q] n 6≡ q + 1 (mod p)

there exists an elliptic cubic curve X over Fq with #G = n

(Voloch, 1988)

if p does not divide #G − 1, then G can be assumed to be cyclic

problem: no polynomial or rational parametrization of the points ofS is possible

Voloch’s solution (1990): implicit description of CP

Page 82: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case: Y 2 = X 3 + AX + B

ifn ∈ [q + 1− 2

√q, q + 1 + 2

√q] n 6≡ q + 1 (mod p)

there exists an elliptic cubic curve X over Fq with #G = n

(Voloch, 1988)

if p does not divide #G − 1, then G can be assumed to be cyclic

problem: no polynomial or rational parametrization of the points ofS is possible

Voloch’s solution (1990): implicit description of CPVoloch’s result would provide complete caps of size ∼ q3/4 for everyq large enough

Page 83: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case: Y 2 = X 3 + AX + B

ifn ∈ [q + 1− 2

√q, q + 1 + 2

√q] n 6≡ q + 1 (mod p)

there exists an elliptic cubic curve X over Fq with #G = n

(Voloch, 1988)

if p does not divide #G − 1, then G can be assumed to be cyclic

problem: no polynomial or rational parametrization of the points ofS is possible

Voloch’s solution (1990): implicit description of CPVoloch’s result would provide complete caps of size ∼ q3/4 for everyq large enough

?

Page 84: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case

G cyclic m | q − 1 m prime

Page 85: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case

G cyclic m | q − 1 m prime

Tate-Lichtenbaum Pairing

< ·, · >: G [m]× G/K → F∗q/(F

∗q)

m

Page 86: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case

G cyclic m | q − 1 m prime

Tate-Lichtenbaum Pairing

< ·, · >: G [m]× G/K → F∗q/(F

∗q)

m

if m2 does not divide #G , then for some T in G [m]

< T , · >: G/K → F∗q/(F

∗q)

m

is an isomorphism such that

K ⊕ Q 7→ [αT (Q)]

where αT is a rational function on X

Page 87: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case

G cyclic m | q − 1 m prime

Tate-Lichtenbaum Pairing

< ·, · >: G [m]× G/K → F∗q/(F

∗q)

m

if m2 does not divide #G , then for some T in G [m]

< T , · >: G/K → F∗q/(F

∗q)

m

is an isomorphism such that

K ⊕ Q 7→ [αT (Q)]

where αT is a rational function on X

S = {R ∈ G | αT (R) = dtm for some t ∈ Fq}

Page 88: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case

S = {R ∈ X | α(R) = dtm for some t ∈ Fq}

Page 89: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case

S = {R ∈ X | α(R) = dtm for some t ∈ Fq}

Page 90: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case

S = {R ∈ X | α(R) = dtm for some t ∈ Fq}P = (a, b) collinear with two points (x , y), (u, v) ∈ S if there existx , y , u, v , t, z ∈ Fq with

Page 91: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case

S = {R ∈ X | α(R) = dtm for some t ∈ Fq}P = (a, b) collinear with two points (x , y), (u, v) ∈ S if there existx , y , u, v , t, z ∈ Fq with

y2 = x3 + Ax + B

v2 = u3 + Au + B(x , y)

(u, v)

(a, b)b

b

b

Page 92: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case

S = {R ∈ X | α(R) = dtm for some t ∈ Fq}P = (a, b) collinear with two points (x , y), (u, v) ∈ S if there existx , y , u, v , t, z ∈ Fq with

y2 = x3 + Ax + B

v2 = u3 + Au + B

α(x , y) = dtm

α(u, v) = dzm

(x , y)

(u, v)

(a, b)b

b

b

Page 93: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case

S = {R ∈ X | α(R) = dtm for some t ∈ Fq}P = (a, b) collinear with two points (x , y), (u, v) ∈ S if there existx , y , u, v , t, z ∈ Fq with

y2 = x3 + Ax + B

v2 = u3 + Au + B

α(x , y) = dtm

α(u, v) = dzm

det

a b 1x y 1u v 1

= 0

(x , y)

(u, v)

(a, b)b

b

b

Page 94: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

elliptic case

S = {R ∈ X | α(R) = dtm for some t ∈ Fq}P = (a, b) collinear with two points (x , y), (u, v) ∈ S if there existx , y , u, v , t, z ∈ Fq with

CP :

y2 = x3 + Ax + B

v2 = u3 + Au + B

α(x , y) = dtm

α(u, v) = dzm

det

a b 1x y 1u v 1

= 0

(x , y)

(u, v)

(a, b)b

b

b

Page 95: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Anbar-G., 2012)

if A 6= 0, then CP is irreducible or admits an irreducible Fq-rationalcomponent

Page 96: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Anbar-G., 2012)

if A 6= 0, then CP is irreducible or admits an irreducible Fq-rationalcomponent

if m is a prime divisor of q − 1 with m < 4√

q/64, then there exists acomplete cap in A

2(Fq) with size at most

m + ⌊q − 2√q + 1

m⌋+ 31

Page 97: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Anbar-G., 2012)

if A 6= 0, then CP is irreducible or admits an irreducible Fq-rationalcomponent

if m is a prime divisor of q − 1 with m < 4√

q/64, then there exists acomplete cap in A

2(Fq) with size at most

m + ⌊q − 2√q + 1

m⌋+ 31 ∼ q3/4

Page 98: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

ℓ(r , q)2,4

Page 99: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

in geometrical terms...

proposition

ℓ(r , q)2,4 = minimum size of a complete cap in Pr−1(Fq)

Page 100: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

in geometrical terms...

proposition

ℓ(r , q)2,4 = minimum size of a complete cap in Pr−1(Fq)

trivial lower bound

#S ≥√2q(N−1)/2 in P

N(Fq)

Page 101: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

in geometrical terms...

proposition

ℓ(r , q)2,4 = minimum size of a complete cap in Pr−1(Fq)

trivial lower bound

#S ≥√2q(N−1)/2 in P

N(Fq)

Page 102: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

N = 3

TLB: √2 · q

Page 103: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

N = 3

TLB: √2 · q

(Pellegrino, 1999)

1

2q√q + 2

Page 104: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

N = 3

TLB: √2 · q

(Pellegrino, 1999)

1

2q√q + 2

(Faina, Faina-Pambianco, Hadnagy 1988-1999)

q2/3

Page 105: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

N = 3

TLB: √2 · q

(Pellegrino, 1999)

Page 106: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

computational results

0

5000

10000

15000

20000

0 500 1000 1500 2000 2500 3000 3500

Page 107: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

recursive constructions of complete caps

blow-up

S cap in Ar (Fqs )

Page 108: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

recursive constructions of complete caps

blow-up

S cap in Ar (Fqs )

for each P in S , substitute each coordinate in Fqs with its expansionover Fq

(x1, x2, . . . , xr ) ∈ Ar (Fqs )

(x11 , x21 , . . . , x

s1 , . . . , x

1r , . . . , x

sr ) ∈ A

rs(Fq)

Page 109: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

recursive constructions of complete caps

blow-up

S cap in Ar (Fqs )

for each P in S , substitute each coordinate in Fqs with its expansionover Fq

(x1, x2, . . . , xr ) ∈ Ar (Fqs )

(x11 , x21 , . . . , x

s1 , . . . , x

1r , . . . , x

sr ) ∈ A

rs(Fq)

the resulting subset of Ars(Fq) is a cap

Page 110: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

recursive constructions of complete caps

blow-up

S cap in Ar (Fqs )

for each P in S , substitute each coordinate in Fqs with its expansionover Fq

(x1, x2, . . . , xr ) ∈ Ar (Fqs )

(x11 , x21 , . . . , x

s1 , . . . , x

1r , . . . , x

sr ) ∈ A

rs(Fq)

the resulting subset of Ars(Fq) is a cap

product

S1 cap in Ar (Fq), S2 cap in A

s(Fq)

Page 111: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

recursive constructions of complete caps

blow-up

S cap in Ar (Fqs )

for each P in S , substitute each coordinate in Fqs with its expansionover Fq

(x1, x2, . . . , xr ) ∈ Ar (Fqs )

(x11 , x21 , . . . , x

s1 , . . . , x

1r , . . . , x

sr ) ∈ A

rs(Fq)

the resulting subset of Ars(Fq) is a cap

product

S1 cap in Ar (Fq), S2 cap in A

s(Fq)

S1 × S2 is a cap in Ar+s(Fq)

Page 112: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

recursive constructions of complete caps

blow-up

S cap in Ar (Fqs )

for each P in S , substitute each coordinate in Fqs with its expansionover Fq

(x1, x2, . . . , xr ) ∈ Ar (Fqs )

(x11 , x21 , . . . , x

s1 , . . . , x

1r , . . . , x

sr ) ∈ A

rs(Fq)

the resulting subset of Ars(Fq) is a cap

product

S1 cap in Ar (Fq), S2 cap in A

s(Fq)

S1 × S2 is a cap in Ar+s(Fq)

do such constructions preserve completeness?

Page 113: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

recursive constructions of complete caps

TN blow-up of a parabola of A2(FqN/2)

Page 114: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

recursive constructions of complete caps

TN blow-up of a parabola of A2(FqN/2)

(Davydov-Ostergard, 2001)

TN is complete in AN(Fq)⇔ N/2 is odd.

Page 115: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

recursive constructions of complete caps

TN blow-up of a parabola of A2(FqN/2)

(Davydov-Ostergard, 2001)

TN is complete in AN(Fq)⇔ N/2 is odd.

Problem: When TN × S is complete?

Page 116: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

external/internal points to a segment

Page 117: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

external/internal points to a segment

(Segre, 1973)

P ,P1,P2 distinct collinear points in A2(Fq)

b bbP1 P P2 ℓ

Page 118: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

external/internal points to a segment

(Segre, 1973)

P ,P1,P2 distinct collinear points in A2(Fq)

b bbP1 P P2 ℓ

the point P is internal or external to the segment P1P2 if

(x − x1)(x − x2) is a non-square in Fq or not,

x , x1, x2 coordinates of P ,P1,P2 w.r.t. any affine frame of ℓ.

Page 119: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering and almost bicovering caps

Page 120: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering and almost bicovering caps

let S be a complete cap in A2(Fq).

b

b

b b

b

b

b

S

Page 121: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering and almost bicovering caps

let S be a complete cap in A2(Fq).

a point P /∈ S is bicovered by S if it isexternal to a segment P1P2, withP1,P2 ∈ S and internal to another segmentP3P4, with P3,P4 ∈ S

b

b

b b

b

b

b

S

bP

Page 122: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering and almost bicovering caps

let S be a complete cap in A2(Fq).

a point P /∈ S is bicovered by S if it isexternal to a segment P1P2, withP1,P2 ∈ S and internal to another segmentP3P4, with P3,P4 ∈ S

b

b

b b

b

b

b

S

bP

P1

P2

Page 123: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering and almost bicovering caps

let S be a complete cap in A2(Fq).

a point P /∈ S is bicovered by S if it isexternal to a segment P1P2, withP1,P2 ∈ S and internal to another segmentP3P4, with P3,P4 ∈ S

b

b

b b

b

b

b

S

bP

P1

P2

P3 P4

Page 124: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering and almost bicovering caps

let S be a complete cap in A2(Fq).

a point P /∈ S is bicovered by S if it isexternal to a segment P1P2, withP1,P2 ∈ S and internal to another segmentP3P4, with P3,P4 ∈ S

b

b

b b

b

b

b

S

bP

P1

P2

P3 P4

definition

S is said to be

bicovering if for every P /∈ S is bicovered by S

Page 125: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering and almost bicovering caps

let S be a complete cap in A2(Fq).

a point P /∈ S is bicovered by S if it isexternal to a segment P1P2, withP1,P2 ∈ S and internal to another segmentP3P4, with P3,P4 ∈ S

b

b

b b

b

b

b

S

bP

P1

P2

P3 P4

definition

S is said to be

bicovering if for every P /∈ S is bicovered by S

almost bicovering if there exists precisely one point not bicovered by

S

Page 126: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

recursive constructions of complete caps

TN blow-up of a parabola in AN(Fq), N ≡ 2 (mod 4)

S complete cap in A2(Fq)

Page 127: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

recursive constructions of complete caps

TN blow-up of a parabola in AN(Fq), N ≡ 2 (mod 4)

S complete cap in A2(Fq)

(G., 2007)

(i) KS = TN × S is complete if and only if S is bicovering

Page 128: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

recursive constructions of complete caps

TN blow-up of a parabola in AN(Fq), N ≡ 2 (mod 4)

S complete cap in A2(Fq)

(G., 2007)

(i) KS = TN × S is complete if and only if S is bicovering

(ii) if S is almost bicovering, then

KS ∪ {(a, a2 − z0, x0, y0) | a ∈ FqN/2}

is complete for some x0, y0, z0 ∈ Fq

Page 129: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering caps in A2(Fq)

remarks:

no probabilistic result is known

Page 130: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering caps in A2(Fq)

remarks:

no probabilistic result is known

no computational constructive method is known

Page 131: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering caps in A2(Fq)

remarks:

no probabilistic result is known

no computational constructive method is known

in the Euclidean plane, no conic is bicovering or almost bicovering

bP

Page 132: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering caps in A2(Fq)

remarks:

no probabilistic result is known

no computational constructive method is known

in the Euclidean plane, no conic is bicovering or almost bicovering

bP

(Segre, 1973)

if q > 13, ellipses and hyperbolas are almost bicovering caps

Page 133: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering caps in A2(Fq)

remarks:

no probabilistic result is known

no computational constructive method is known

in the Euclidean plane, no conic is bicovering or almost bicovering

bP

(Segre, 1973)

if q > 13, ellipses and hyperbolas are almost bicovering caps

let N ≡ 0 (mod 4); if q > 13, then there exists a complete cap of size

#TN−2 · [(q − 1) + 1] = qN2

Page 134: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

how to prove that an algebraic cap is bicovering

S = {(f (t), g(t))︸ ︷︷ ︸

Pt

| t ∈ Fq}

Page 135: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

how to prove that an algebraic cap is bicovering

S = {(f (t), g(t))︸ ︷︷ ︸

Pt

| t ∈ Fq}

P = (a, b) ∈ A2(Fq)

Page 136: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

how to prove that an algebraic cap is bicovering

S = {(f (t), g(t))︸ ︷︷ ︸

Pt

| t ∈ Fq}

P = (a, b) ∈ A2(Fq)

(1) consider the space curve

YP :

{

FP(X ,Y ) = 0

(a − f (X ))(a − f (Y )) = Z 2

Page 137: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

how to prove that an algebraic cap is bicovering

S = {(f (t), g(t))︸ ︷︷ ︸

Pt

| t ∈ Fq}

P = (a, b) ∈ A2(Fq)

(1) consider the space curve

YP :

{

FP(X ,Y ) = 0

(a − f (X ))(a − f (Y )) = Z 2

(2) apply Hasse-Weil to YP (if possible) and find a suitable point(x , y , z) ∈ YP(Fq)

Page 138: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

how to prove that an algebraic cap is bicovering

S = {(f (t), g(t))︸ ︷︷ ︸

Pt

| t ∈ Fq}

P = (a, b) ∈ A2(Fq)

(1) consider the space curve

YP :

{

FP(X ,Y ) = 0

(a − f (X ))(a − f (Y )) = Z 2

(2) apply Hasse-Weil to YP (if possible) and find a suitable point(x , y , z) ∈ YP(Fq)

the point P is external to the segment joining Px and Py

Page 139: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

how to prove that an algebraic cap is bicovering

S = {(f (t), g(t))︸ ︷︷ ︸

Pt

| t ∈ Fq}

P = (a, b) ∈ A2(Fq)

(1) consider the space curve

YP,c :

{

FP(X ,Y ) = 0

(a − f (X ))(a − f (Y )) = cZ 2

(2) apply Hasse-Weil to YP (if possible) and find a suitable point(x , y , z) ∈ YP(Fq)

the point P is external to the segment joining Px and Py

(3) fix a non-square c in F∗q and repeat for YP,c

Page 140: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering caps from cubic curves

the method works well for S a coset of a cubic X , and P a point offthe cubic.

Page 141: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering caps from cubic curves

the method works well for S a coset of a cubic X , and P a point offthe cubic.

in order to bicover the points on the cubics, more cosets of the samesubgroup are needed: the cosets corresponding to a maximal3-independent subset in the factor group G/K

Page 142: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering caps from cubic curves

the method works well for S a coset of a cubic X , and P a point offthe cubic.

in order to bicover the points on the cubics, more cosets of the samesubgroup are needed: the cosets corresponding to a maximal3-independent subset in the factor group G/K

in the best case bicovering caps of size approximately q7/8 areobtained

Page 143: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering caps from cubic curves

the method works well for S a coset of a cubic X , and P a point offthe cubic.

in order to bicover the points on the cubics, more cosets of the samesubgroup are needed: the cosets corresponding to a maximal3-independent subset in the factor group G/K

in the best case bicovering caps of size approximately q7/8 areobtained

for N ≡ 0 (mod 4) complete caps of size approximately qN2 −

18 are

obtained, provided that suitable divisors of q, q − 1, q + 1 exist

Page 144: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

bicovering caps from cubic curves

the method works well for S a coset of a cubic X , and P a point offthe cubic.

in order to bicover the points on the cubics, more cosets of the samesubgroup are needed: the cosets corresponding to a maximal3-independent subset in the factor group G/K

in the best case bicovering caps of size approximately q7/8 areobtained

for N ≡ 0 (mod 4) complete caps of size approximately qN2 −

18 are

obtained, provided that suitable divisors of q, q − 1, q + 1 exist

if Voloch’s gap is filled, we will have bicovering caps with roughlyq7/8 points for any odd q

Page 145: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

the cuspidal case

X : Y − X 3 = 0

(Anbar-Bartoli-G.-Platoni, 2013)

let

q = ph, with p > 3 a prime

m = ph′

, with h′ < h and m ≤ 4√q

4

then there exists an almost bicovering cap contained in X , of size

n =

(2√m − 3)

q

m, if h′ is even

(√m

p+√mp − 3

)q

m, if h′ is odd

∼ q7/8

Page 146: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

the nodal case

X : XY − (X − 1)3 = 0

(Anbar-Bartoli-G.-Platoni, 2013)

assume that

q = ph, with p > 3 a prime

m is an odd divisor of q − 1, with (3,m) = 1 and m ≤ 4√q

3.5

m = m1m2 s.t. (m1,m2) = 1 and m1,m2 ≥ 4

then there exists a bicovering cap contained in X of size

n ≤ m1 +m2

m(q − 1)∼ q7/8

Page 147: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

the isolated double point case

X : Y (X 2 − β) = 1

(Anbar-Bartoli-G.-Platoni, 2013)

assume that

q = ph, with p > 3 a prime

m is a proper divisor of q + 1 such that (m, 6) = 1 and m ≤ 4√q

4

m = m1m2 with (m1,m2) = 1

then there exists an almost bicovering cap contained in X of size lessthan or equal to

(m1 +m2 − 3) · q + 1

m+ 3 ∼ q7/8

Page 148: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

the elliptic case

X : Y 2 − X 3 − AX − B = 0

(Anbar-G., 2012)

assume that

q = ph, with p > 3 a prime

m is a prime divisor of q − 1, with 7 < m < 18

4√q

then there exists a bicovering cap contained in X of size

n ≤ 2√m

(⌊q − 2

√q + 1

m

+ 31

)

∼ q7/8

Page 149: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

ℓ(r , q)r−1,r+1

Page 150: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

ℓ(r , q)r−1,r+1

Reed-Solomon codes: ℓ(r , q)r−1,r+1 ≤ q + 1

Page 151: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

AG codes from elliptic curves

X : Y 2 = X 3 + AX + B 4A3 + 27B2 6= 0

O common pole of x and y

P1, . . . ,Pn rational points of X (distinct from O)

Page 152: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

AG codes from elliptic curves

X : Y 2 = X 3 + AX + B 4A3 + 27B2 6= 0

O common pole of x and y

P1, . . . ,Pn rational points of X (distinct from O)

Cr = C (D,G)⊥, where G = rO,D = P1 + . . .+ Pn, n > r

Page 153: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

AG codes from elliptic curves

X : Y 2 = X 3 + AX + B 4A3 + 27B2 6= 0

O common pole of x and y

P1, . . . ,Pn rational points of X (distinct from O)

Cr = C (D,G)⊥, where G = rO,D = P1 + . . .+ Pn, n > r

Cr is an [n, n − r , r + 1]q-MDS-code if and only if for everyPi1 , . . . ,Pir

Pi1 ⊕ . . .⊕ Pir 6= O

Page 154: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

AG codes from elliptic curves

X : Y 2 = X 3 + AX + B 4A3 + 27B2 6= 0

O common pole of x and y

P1, . . . ,Pn rational points of X (distinct from O)

Cr = C (D,G)⊥, where G = rO,D = P1 + . . .+ Pn, n > r

Cr is an [n, n − r , r + 1]q-MDS-code if and only if for everyPi1 , . . . ,Pir

Pi1 ⊕ . . .⊕ Pir 6= O

(Munuera, 1993)

If Cr is MDS then, for n > r + 2,

n ≤ 1

2(#X (Fq)− 3 + 2r)

Page 155: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

covering radius of elliptic MDS codes

a subset T of an abelian group H is r -independent if for eacha1, . . . , ar ∈ T ,

a1 + a2 + . . .+ ar 6= 0

Page 156: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

covering radius of elliptic MDS codes

a subset T of an abelian group H is r -independent if for eacha1, . . . , ar ∈ T ,

a1 + a2 + . . .+ ar 6= 0

{P1, . . . ,Pn} maximal r -independent subset of X (Fq)

Page 157: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

covering radius of elliptic MDS codes

a subset T of an abelian group H is r -independent if for eacha1, . . . , ar ∈ T ,

a1 + a2 + . . .+ ar 6= 0

{P1, . . . ,Pn} maximal r -independent subset of X (Fq)

letφr : X → P

r−1 φr = (1 : f1 : . . . : fr−1)

with1, f1, . . . , fr−1 basis of L(rO)

Page 158: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

covering radius of elliptic MDS codes

a subset T of an abelian group H is r -independent if for eacha1, . . . , ar ∈ T ,

a1 + a2 + . . .+ ar 6= 0

{P1, . . . ,Pn} maximal r -independent subset of X (Fq)

letφr : X → P

r−1 φr = (1 : f1 : . . . : fr−1)

with1, f1, . . . , fr−1 basis of L(rO)

R(Cr ) = r − 1 if and only if each point in Pr−1(Fq) belongs to the

hyperplane generated by some

φr (Pi1), φr (Pi2), . . . , φr (Pir−1)

Page 159: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Bartoli-G.-Platoni, 2013)

if

- (X (Fq),⊕) ∼= Zm × K cyclic for m > 3 a prime

- S = K ⊕ P covers all the points in A2(Fq) off X

- T ⊃ S is a maximal r -independent subset of X (Fq)

Page 160: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Bartoli-G.-Platoni, 2013)

if

- (X (Fq),⊕) ∼= Zm × K cyclic for m > 3 a prime

- S = K ⊕ P covers all the points in A2(Fq) off X

- T ⊃ S is a maximal r -independent subset of X (Fq)

then almost every point in Pr−1(Fq) belongs to some hyperplane

generated by r − 1 points of φr (T )

Page 161: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Bartoli-G.-Platoni, 2013)

if

- (X (Fq),⊕) ∼= Zm × K cyclic for m > 3 a prime

- S = K ⊕ P covers all the points in A2(Fq) off X

- T ⊃ S is a maximal r -independent subset of X (Fq)

then almost every point in Pr−1(Fq) belongs to some hyperplane

generated by r − 1 points of φr (T )

if m is a prime divisor of q − 1 with m < 4√

q/64, then

ℓ(r , q)r−1,r+1 ≤ (⌈r/2⌉−1)(|S |−1)+2m+ 1

r − 2+2r

Page 162: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Bartoli-G.-Platoni, 2013)

if

- (X (Fq),⊕) ∼= Zm × K cyclic for m > 3 a prime

- S = K ⊕ P covers all the points in A2(Fq) off X

- T ⊃ S is a maximal r -independent subset of X (Fq)

then almost every point in Pr−1(Fq) belongs to some hyperplane

generated by r − 1 points of φr (T )

if m is a prime divisor of q − 1 with m < 4√

q/64, then

ℓ(r , q)r−1,r+1 ≤ (⌈r/2⌉−1)(|S |−1)+2m+ 1

r − 2+2r∼ (⌈r/2⌉ − 1)q3/4

Page 163: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

(Bartoli-G.-Platoni, 2013)

if

- (X (Fq),⊕) ∼= Zm × K cyclic for m > 3 a prime

- S = K ⊕ P covers all the points in A2(Fq) off X

- T ⊃ S is a maximal r -independent subset of X (Fq)

then almost every point in Pr−1(Fq) belongs to some hyperplane

generated by r − 1 points of φr (T )

if m is a prime divisor of q − 1 with m < 4√

q/64, then

ℓ(r , q)r−1,r+1 ≤ (⌈r/2⌉−1)(|S |−1)+2m+ 1

r − 2+2r∼ (⌈r/2⌉ − 1)q3/4

Page 164: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

problems

explanation for experimental results

Page 165: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

problems

explanation for experimental results

Voloch’s proof for plane caps in elliptic cubics

Page 166: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

problems

explanation for experimental results

Voloch’s proof for plane caps in elliptic cubics

bicovering caps in dimensions different from 2

Page 167: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

problems

explanation for experimental results

Voloch’s proof for plane caps in elliptic cubics

bicovering caps in dimensions different from 2

non-recursive constructions in higher dimensions

Page 168: Good covering codes from algebraic curves · Good covering codes from algebraic curves Massimo Giulietti University of Perugia (Italy) Special Semester on Applications of Algebra

problems

explanation for experimental results

Voloch’s proof for plane caps in elliptic cubics

bicovering caps in dimensions different from 2

non-recursive constructions in higher dimensions

probabilistic results intrinsic to higher dimensions