Login / Signup

Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance.

Sergey YekhaninIlya Dumer
Published in: IEEE Trans. Inf. Theory (2004)
Keyphrases
  • non binary
  • decoding algorithm
  • upper bound
  • lower bound
  • distance measure
  • worst case
  • constraint satisfaction problems
  • error correction
  • mining high utility itemsets
  • small number
  • distance function
  • special case