Login / Signup
On the bounds and achievability about the ODPC of $\mathcal{GRM}(2, m)^*$ over prime field for increasing message length.
Xiaogang Liu
Yuan Luo
Published in:
CoRR (2013)
Keyphrases
</>
upper bound
email
upper and lower bounds
total length
tight bounds
information retrieval
multi agent
expert systems
association rules
error bounds
graduate students
fixed length
average case