Login / Signup

; 3)-codes (k>=3, 0<=alpha<gamma<k-1) meeting the Griesmer bound.

Noboru HamadaTor Helleseth
Published in: Discret. Math. (1992)
Keyphrases
  • upper bound
  • lower bound
  • worst case
  • meeting room
  • error bounds
  • error correction
  • error correcting
  • computer vision
  • image processing
  • markov random field
  • vc dimension
  • error correcting codes