An Algorithm for Computing $m$-Tight Error Linear Complexity of Sequences over $GF(p^{m})$ with Period $p^{m}$

Computer Science – Cryptography and Security

Scientific paper


  [ 0.00 ] – not rated yet Voters 0   Comments 0

Please leave your Comment & Rating

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.