Low Rank Parity Check Codes and their application in Power Line Communications smart grid networks

We investigate the use of Low Rank Parity Check Codes, originally designed for cryptography applications in the context of Power Line Communication. Particularly, we propose a new code design and an efficient probabilistic decoding algorithm. The main idea of decoding Low Rank Parity Check Codes is based on calculations of vector spaces over a finite field math formula. Low Rank Parity Check Codes can be seen as the identical of Low Density Parity check codes. We compare the performance of this code against the Reed-Solomon Code through a Power Line Communication channel.