Stopping Sets of Hermitian Codes
Sarah E. Anderson, Gretchen L. Matthews · IEEE Transactions on Information Theory · 2016
Combinatorial structures called stopping sets are useful in analyzing the performance of a linear code when coupled with an iterative decoding algorithm over an erasure channel. In this paper, we consider stopping sets of Hermitian codes.