Sciweavers

77
Voted
TIT
2008
83views more  TIT 2008»
14 years 10 months ago
Hard Problems of Algebraic Geometry Codes
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 proble...
Qi Cheng