  In this paper we present an extended variant of low rank parity check matrix
(LRPC) codes that have received significant interests in recent years. It is
shown that the extension indeed yields a superfamily of LRPC codes, which are
termed low row rank parity check codes. The decoding method of the proposed
codes is also investigated.
