Login / Signup

On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound.

Leonid A. BassalygoStefan M. DodunekovTor HellesethVictor A. Zinoviev
Published in: ITW (2006)
Keyphrases
  • upper bound
  • worst case
  • error bounds
  • lower bound
  • database