Abstract

We investigate the use of Low Rank Parity Check Codes (LRPC), originally designed for cryptography applications in the context of Power Line Communication (PLC). Particularly we propose a new code design and an efficient probabilistic decoding algorithm. The main idea of decoding LRPC codes is based on calculations of vector spaces over a finite field F q . This family of codes can be seen as the equivalent of classical LDPC codes for the rank metric. We compare the performance of this code against the Reed-Solomon Code (RS) through a PLC channel. We show by simulation that the proposed system outperforms the traditional scheme where the PLC channel is subjected to both impulsive noise and narrowband interference.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call