kth-order sum-free functions correspond to codimension-m subcodes of RM(n-k,n) with minimum distance 3*2^{k-1}, yielding subcodes with 1.5 times the original distance for 2≤k≤n-2 and m≤n.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Reed-Muller subcodes, Grassmannian partitions and sum-free functions
kth-order sum-free functions correspond to codimension-m subcodes of RM(n-k,n) with minimum distance 3*2^{k-1}, yielding subcodes with 1.5 times the original distance for 2≤k≤n-2 and m≤n.