pith. sign in

arxiv: 1004.5367 · v2 · pith:OE2DFI5Mnew · submitted 2010-04-29 · 💻 cs.IT · math.IT

Multiplicatively Repeated Non-Binary LDPC Codes

classification 💻 cs.IT math.IT
keywords codesldpcnon-binarycodelow-ratemothermultiplicativelypropose
0
0 comments X
read the original abstract

We propose non-binary LDPC codes concatenated with multiplicative repetition codes. By multiplicatively repeating the (2,3)-regular non-binary LDPC mother code of rate 1/3, we construct rate-compatible codes of lower rates 1/6, 1/9, 1/12,... Surprisingly, such simple low-rate non-binary LDPC codes outperform the best low-rate binary LDPC codes so far. Moreover, we propose the decoding algorithm for the proposed codes, which can be decoded with almost the same computational complexity as that of the mother code.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.