Low Density Parity Check (LDPC) codes have been of great interest to researchers due to its low complexity in encoding as well as decoding. Since the introduction of Turbo codes in 1993, importance of LDPC codes has been widely explored. Various techniques have been introduced for encoding and decoding of low density parity check codes based on algebraic structures, codes on graphs, etc. In this paper, a new method of constructing binary and nonbinary LDPC-like codes from Kernel codes defined over groups is discussed. Also, we show that constructions of binary and nonbinary LDPC-like codes are particular cases of our proposed method. © Springer India 2016.