HRS codes achieve Schur square dimension (2t-2s+1)s under p≥t≥2s and t≤(r+2s-1)/2, equaling t(t+1)/2 when t=2s and r≥t+1, matching random codes.
Effective attack on the McEliece cryptosystem based on Reed-Muller codes.Discrete Mathematics & Applications, 24(5), 2014
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
-
The dimensions of Schur squares of HRS codes
HRS codes achieve Schur square dimension (2t-2s+1)s under p≥t≥2s and t≤(r+2s-1)/2, equaling t(t+1)/2 when t=2s and r≥t+1, matching random codes.