A note on the weight distribution of the Schubert code C ( 2 , m ) - - PowerPoint PPT Presentation

a note on the weight distribution of the schubert code c
SMART_READER_LITE
LIVE PREVIEW

A note on the weight distribution of the Schubert code C ( 2 , m ) - - PowerPoint PPT Presentation

Basic Notions A note on the weight distribution of the Schubert code C ( 2 , m ) F . Piero (joint work with Prashant Singh) Department of Mathematics University of Puerto Rico at Ponce Fifth Irsee Conference on Finite Geometries,


slide-1
SLIDE 1

Basic Notions

A note on the weight distribution of the Schubert code Cα(2, m)

F . Piñero (joint work with Prashant Singh)

Department of Mathematics University of Puerto Rico at Ponce

Fifth Irsee Conference on Finite Geometries, September 2017

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-2
SLIDE 2

Basic Notions Basic Definitions

Definition (Grassmannian) The Grassmannian of all ℓ–subspaces of Fm

q is given by

Gℓ,m := {W ⊆ Fm

q : W is a subspace and dim W = ℓ}.

For each W ∈ G, we pick an ℓ × m matrix, MW whose rowspace is W.

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-3
SLIDE 3

Basic Notions Basic Definitions

Definition I(ℓ, m) := {(α1 < α2 < · · · < αℓ) | 1 ≤ αi ≤ m} Definition For a generic ℓ × m matrix X, and I ∈ I(ℓ, m) denote by detI(X) the ℓ × ℓ minor given by the columns indexed by I. Definition We denote by ∆(ℓ, m) := {

  • I∈I(ℓ,m)

fIdetI(X) | fI ∈ Fq}.

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-4
SLIDE 4

Basic Notions Basic Definitions

Definition (Evaluation Map) evGℓ,m : ∆(ℓ, m) → Fq f → (f(MW))W∈Gℓ,m Definition (Grassmann code) Cα(ℓ, m) := {evGℓ,m(f) | W ∈ Gℓ,m, f ∈ ∆(ℓ, m)} ⊆ FGℓ,m

q

Cα(ℓ, m) is a linear code obtained from the Plücker embedding of Gℓ,m onto a linear space.

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-5
SLIDE 5

Basic Notions Basic Definitions

Definition (Bruhat Order) For α = (α1, α2, . . . , αℓ) and β = (β1, β2, . . . , βℓ) we say that α ≤ β if and only if αi ≤ βi for all i. Definition (Schubert variety) Let α ∈ I(ℓ, m). The Schubert variety may be defined as: Ωα(ℓ, m) := {W ∈ Gℓ,m | detI(MW) = 0, ∀I ≤ α}

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-6
SLIDE 6

Basic Notions Basic Definitions

Definition (Evaluation Map (for Schubert varieties) evΩα(ℓ,m) : ∆(ℓ, m) → Fq f → (f(MW))W∈Ωα(ℓ,m) Definition (Schubert codes) Cα(ℓ, m) := {evΩα(ℓ,m)(f) | f ∈ ∆(ℓ, m)} ⊆ FΩα(ℓ,m)

q

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-7
SLIDE 7

Basic Notions Basic Definitions

Ryan introduced Grassmann codes for q = 2 in 1988. Nogin generalized Grassmann codes to arbitrary q in 1996. Grassmann codes are m

  • q,

m

  • , qℓ(m−ℓ)

codes.

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-8
SLIDE 8

Basic Notions Basic Definitions

Nogin determined the weight distribution for ℓ = 2. He observed that for MW = . . . xi . . . xj . . . . . . yi . . . yj . . .

  • , the

function det{i,j}(Mw) = xDyT where most of the entries of D are zero except for Di,j = −Dj,i = 1.

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-9
SLIDE 9

Basic Notions Basic Definitions

Definition Let f =

i

  • i=1

m

  • j=i+1

fi,jdet{i,j}(X) ∈ ∆(2, m). Define F to be the skew–symmetric matrix corresponding to f, that is Fa1,a2 = −Fa2,a1 = f{(a1,a2)}. This means that if the rows of MW are x and y then f(MW) = xFyT

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-10
SLIDE 10

Basic Notions Basic Definitions

Theorem (Nogin) Let f ∈ ∆(ℓ, m). Let F be the matrix corresponding to f. Suppose the rank of F is r. Then wt(evGℓ,m(f)) = q2(m−r+1) q2r − 1 q2 − 1 . Counting the number of skew–symmetric matrices of a particular rank will give the weight distribution for the Grassmann code in the case ℓ = 2.

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-11
SLIDE 11

Basic Notions Basic Definitions

Let A1 = {e1, e2, . . . , ea1}. For the case ℓ = 2 we give an alternative definition of Ωα(ℓ, m), where α = (a1, m). Definition (Schubert variety) Ωα(ℓ, m) := {W ∈ Gℓ,m | dim(W ∩ Ai) ≥ 1} Definition (Schubert variety) Ωα(ℓ, m) := {W ∈ Gℓ,m | detI(MW) = 0, ∀I = (b1, b2), b1 > a1}

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-12
SLIDE 12

Basic Notions Basic Definitions

We know the parameters of Cα(2, m) where α = (a1, m) The length is (qm − 1)(qm−1 − 1) (q2 − 1)(q − 1) −

m−a1+1

  • j=1

j

  • i=1

q2m−j−2−i. The dimension is m(m − 1) 2 − (m − a1)(m − a1 − 1) 2 . (H. Chen (2000) and Guerra–Vincenti (2002)) The minimum distance is qm+α1−3. (Guerra – Vincenti 2004) determined the weight spectrum

  • f Cα(2, m).

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-13
SLIDE 13

Basic Notions Basic Definitions

For the Schubert code Cα(2, m) we may consider the codewords corresponding to block matrices of the form: F =

  • A

B −BT 0m−a1×m−a1

  • where A is a skew–symmetric a1 × a1 matrix with zeros on the

diagonal and B is a a1 × m − a1 matrix.

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-14
SLIDE 14

Basic Notions Basic Definitions

We investigate the weight of xFyT where x ∈ A1. We may represent xFyT as

  • x1

A B −BT yT

1

yT

2

  • = x1AyT

1 + x1ByT 2

where y2 = 0.

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-15
SLIDE 15

Basic Notions Basic Definitions

Suppose that A has corank r1, B has corank r2 and their left kernels intersect in a space of dimension r. For how many vectors x ∈ A1 and y ∈ Fm

q \ A1 is

x1AyT

1 + x1ByT 2 = 0?

#x1 #y1 × #y2 x1A = 0, x1B = 0 qr x1A = 0, x1B = 0 qr2 − qr (qa1 − qa1−1)(qm−a1 − 1) x1A = 0, x1B = 0 qr1 − qr qm − qm−1 x1A = 0, x1B = 0 qm − qr1 − qr2 + qr (qa1 − qa1−1)(qm−a1 − 1) In total we have (qm − qr1)(qa1 − qa1−1)(qm−a1 − 1) + (qr1 − qr)(qm − qm−1) pairs of vectors.

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-16
SLIDE 16

Basic Notions Basic Definitions

Suppose that A has corank r1, B has corank r2 and their left kernels intersect in a space of dimension r. For how many vectors x ∈ A1 and y ∈ Fm

q \ A1 is

x1AyT

1 + x1ByT 2 = 0?

#x1 #y1 × #y2 x1A = 0, x1B = 0 qr x1A = 0, x1B = 0 qr2 − qr (qa1 − qa1−1)(qm−a1 − 1) x1A = 0, x1B = 0 qr1 − qr qm − qm−1 x1A = 0, x1B = 0 qm − qr1 − qr2 + qr (qa1 − qa1−1)(qm−a1 − 1) In total we have (qm − qr1)(qa1 − qa1−1)(qm−a1 − 1) + (qr1 − qr)(qm − qm−1) pairs of vectors.

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-17
SLIDE 17

Basic Notions Basic Definitions

Suppose that A has corank r1, B has corank r2 and their left kernels intersect in a space of dimension r. For how many vectors x ∈ A1 and y ∈ Fm

q \ A1 is

x1AyT

1 + x1ByT 2 = 0?

#x1 #y1 × #y2 x1A = 0, x1B = 0 qr x1A = 0, x1B = 0 qr2 − qr (qa1 − qa1−1)(qm−a1 − 1) x1A = 0, x1B = 0 qr1 − qr qm − qm−1 x1A = 0, x1B = 0 qm − qr1 − qr2 + qr (qa1 − qa1−1)(qm−a1 − 1) In total we have (qm − qr1)(qa1 − qa1−1)(qm−a1 − 1) + (qr1 − qr)(qm − qm−1) pairs of vectors.

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-18
SLIDE 18

Basic Notions Basic Definitions

Theorem Let f ∈ ∆(2, m) such that its associated matrix, F is of the form F =

  • A

B −BT 0m−a1×m−a1

  • where F is as before,

then the weight of the codeword of Cα(2, m) corresponding to f is wt(cf) = (qa1 − qr1)(qa1 − qa1−1)(qm−a1 − 1) (q − 1)(q2 − q) (1) +(qr1 − qr)(qm − qm−1) (q − 1)(q(q − 1)) (2) +q2(r1−1) qa1−r1 − 1 q2 − 1 (3)

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-19
SLIDE 19

Basic Notions Basic Definitions

Definition Let f ∈ ∆(2, m) such that its associated matrix, F is of the form F =

  • A

B −BT 0m−a1×m−a1

  • where

A is a skew–symmetric a1 × a1 matrix B is a a1 × m − a1 matrix, A has corank r1, B has corank r2 and their left kernels intersect in a space of dimension r. We denote by d(r1, r) := wt(ev(f)). w(cf) depends only on r1 and r. and (s, s1) = (r, r1) implies d(s, s1) = d(r, r1).

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-20
SLIDE 20

Basic Notions Basic Definitions

Main Result

For α = (a1, m), the weight distribution of Cα(2, m) is given by

a1

  • r1=0

r1

  • r=0

N1(α1, α1−r1) r1 r

  • q

α1

  • r2=r

Λ(α1, α1 − r2)∆(α1, r1, r2, r)

  • X d(r1,r)

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-21
SLIDE 21

Basic Notions Basic Definitions

So in order to find the weight distribution we sum the product of The number of skew–symmetric a1 × a1 matrices A of rank a1 − r1 N1(a1, α1 − r1) := q( a1−r1

2

)( a1−r1

2

−1) a1−r1−1

  • i=0

(qa1−i − 1)

a1−r1 2

−1

  • i=0

(qa1−r1−2i − 1)

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-22
SLIDE 22

Basic Notions Basic Definitions

times The number of r dimensional subspaces of the left kernel r1 r

  • q

times The number of r2–dimensional spaces intersecting the left kernel of A in exactly an r–dimensional subspace ∆(α1, r1, r2, r) =

r2

  • j=r

(−1)j−rq(j−r

2 )

r1 − r j − r

  • q

α1 − j r2 − j

  • q

times

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-23
SLIDE 23

Basic Notions Basic Definitions

The number of a1 × m − a1 matrices whose left kernel is exactly a fixed r2–dimensional subspace. Λ(α1, r2, m) =

r2−1

  • i=0

(qm−a1 − qi).

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)

slide-24
SLIDE 24

Basic Notions Basic Definitions

Thank you for your attention!

Piñero, Fernando weight distribution of Schubert codes of Cα(2, m)