Learn More
  • Qi Cheng
  • IEEE Transactions on Information Theory
  • 2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum-likelihood decoding problem is one of the most important algorithmic problems of a code. While(More)