Generalized minimum-distance decoding: Difference between revisions

Content deleted Content added
fixed major formatting issues (more problems remain)
Line 15:
 
==Randomized algorithm==
Consider the received word <math>\mathbf{y} = (y_1,\ldots,y_N) \in [q^n]^N</math> which was corrupted by a [[noisy channel]]. The following is the algorithm description for the general case. In this algorithm, we can decode y by just declaring an erasure at every bad position and running the errors and erasure decoding algorithm for <math>C_\text{out}</math> on the resulting vector.
 
'''Randomized_Decoder'''