Login / Signup

Code bounds for multiple packings over a nonbinary finite alphabet.

Vladimir M. Blinovsky
Published in: Probl. Inf. Transm. (2005)
Keyphrases
  • non binary
  • finite alphabet
  • bayesian networks
  • special case
  • upper bound