On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length
From MaRDI portal
Publication:2260787
DOI10.1007/s10623-013-9877-5zbMath1342.94116arXiv1307.0927MaRDI QIDQ2260787
Publication date: 12 March 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.0927
quadratic form; cyclic code; exponential sum; generalized Reed-Muller code; optimum distance profile