List decoding of crisscross error patterns


List decoding of crisscross errors in arrays over finite fields is considered. A Johnson-like upper bound on the maximum list size in the cover metric is derived, showing that the list of codewords has polynomial size up to a certain radius. Further, a simple list decoding algorithm for a known optimal code construction is presented, which decodes errors in… (More)
DOI: 10.1109/ISIT.2014.6875030
View Slides


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics