On maximum-length linear congruential-sequences-based low-density parity-check codes |
| |
Authors: | Jing Sun Takeshita OY |
| |
Affiliation: | Qualcomm Inc., San Diego, CA, USA; |
| |
Abstract: | This letter extends a low-density parity-check code construction using maximum-length linear congruential sequences by Prabhakar and Narayanan. The corresponding bipartite graphs of their construction were guaranteed to have a girth larger than four by a sufficient condition. However, their sufficient condition was limited to regular codes and data-node degree equal to three. The extension in this letter allows arbitrary data-node degrees and is applicable to irregular codes. Further, simpler sufficient conditions are derived and larger girths are addressed. |
| |
Keywords: | |
|
|