Sign in

A family of negacyclic BCH codes of length $n=\frac {q^{2m}-1}{2}$.

Guanmin GuoRuihu LiYang LiuJunli Wang
Published in: Cryptogr. Commun. (2020)
Keyphrases
  • reed solomon
  • error correction
  • lower bound
  • special case
  • database
  • machine learning
  • error detection
  • error control
  • data sets
  • case study
  • vc dimension
  • decoding algorithm
  • total length
  • finite alphabet