Two error-erasure decoding algorithms for product codes that correct all the error-erasure patterns guaranteed correctable by the minimum Hamming distance of the product code are given. The first algorithm works when at least one of the component codes is majority-logic decodable. The second algorithm works for any product code. Both algorithms use the decoders of the component codes.
No takes yet. Share an insight, caveat, or question.
S. Wainberg (1972) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: