4.6 Basefold Random Linear Foldable Code and the Distance Proof

Lemma 4.6.1 (Lemma 2 [CF24]).

Fix any generator matrix 𝐆d−1 where the encoding of any nonzero message 𝐦∈𝔽kd−1 has fewer than td−1 zeroes. For any subset S⊆[1,nd−1],

  • •

    if |S|<td−1, then |md⁢(S)|<|𝔽|2⁢(td−1−|S|),

  • •

    if |S|≥td−1, then |md⁢(S)|=1.

Proof.

When |S|≥td−1, only 𝐦=𝟎 can make all alphabets over S being 0. Hence, dimker⁡(Gd−1,S𝖳)=0, |md⁢(S)|=1.

Let T⊆[1,nd−1]∖S of size td−1−|S|. We first have

rank⁢(Gd−1,T∪S𝖳) ≤rank⁢(Gd−1,S𝖳)+rank⁢(Gd−1,T𝖳)
≤rank⁢(Gd−1,S𝖳)+(td−1−|S|).

By Rank-Nullity,

kd−1=rank⁢(Gd−1,T∪S𝖳)+dimker⁡(Gd−1,T∪S𝖳),

since the linear code alphabets over T∪S is 𝟎 iff 𝐦=𝟎 191919 or by td−1≥kd−1 as nd−1−td−1+1 is the distance of the (d−1)th level linear code, which is no more than nd−1−kd−1+1 by MDS code. , then

dimker⁡(𝐆d−1,T∪S𝖳)=0,

hence rank⁢(Gd−1,T∪S𝖳)=kd−1, and rank⁢(Gd−1,S𝖳)≥kd−1−(td−1−|S|). Again by Rank-Nullity,

kd−1=rank⁢(Gd−1,S𝖳)+dimker⁡(Gd−1,S𝖳),

and hence,

dimker⁡(Gd−1,S𝖳)≤td−1−|S|,

which completes the proof, that |md⁢(S)|≤|F|2⁢(td−1−|S|). ∎

TODO: basefold stuffs [CF24].