Euclidean geometry codes, minimum weight words and decodable error-patterns using bit-flipping
暂无分享,去创建一个
We determine the number of minimum weight codewords in a class of Euclidean geometry codes and link the performance of bit-flipping decoding to the geometry of the error patterns
[1] J. Hirschfeld. Projective Geometries Over Finite Fields , 1980 .
[2] Shu Lin,et al. Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.