Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Errof Floors of Non-Binary LDPC Codes

隆之 野崎, T. Nozaki, 健太 笠井, Kenta Kasai, 好一 坂庭, KOHICHI SAKANIWA

Published Jun 1, 2010• 0 citations
OpenAlex

Related papers

Error floors of non-binary LDPC codes

隆之 野﨑, Kenta Kasai, KOHICHI SAKANIWA

•Jun 1, 2010•0 citations

Analysis of Error Floors of Non-Binary LDPC Codes over BEC

隆之 野崎, T. Nozaki, 健太 笠井 +3 more

•Jan 1, 2012•0 citations

Analysis of Error Floors of Non-Binary LDPC Codes over MBIOS Channel

Takayuki Nozaki, Kenta Kasai, 好一 坂庭 +1 more

•Jun 1, 2011•0 citations

Analysis of error floors for non-binary LDPC codes over general linear group through q-ary memoryless symmetric channels

隆之 野﨑, Kenta Kasai, KOHICHI SAKANIWA

In this paper, we compare the decoding error rates in the error floors for non-binary low-density parity-check (LDPC) codes over general linear groups with those for non-binary LDPC codes over finite fields transmitted through the q-ary memoryless symmetric channels under belief propagation decoding.To analyze non-binary LDPC codes defined over both the general linear group GL(m, F 2 ) and the finite field F 2 m , we investigate non-binary LDPC codes defined over GL(m 3 , F 2 m 4 ).We propose a method to lower the error floors for non-binary LDPC codes.In this analysis, we see that the non-binary LDPC codes constructed by our proposed method defined over general linear group have the same decoding performance in the error floors as those defined over finite field.The non-binary LDPC codes defined over general linear group have more choices of the labels on the edges which satisfy the condition for the optimization.

•Dec 1, 2012•0 citations

Non-binary LDPC Codes and Their Applications

Kasai Kenta

IEICE Technical Report; IEICE Tech. Rep.•Sep 14, 2010•0 citations

Analysis of error floors of generalized non-binary LDPC codes over q-ary memoryless symmetric channels

T. Nozaki, Kenta Kasai, Kohichi Sakaniwa

In this paper, we compare the decoding error rates in the error floors for non-binary low-density parity-check (LDPC) codes over the general linear group with those for non-binary LDPC codes over finite field transmitted over the q-ary memoryless symmetric channel under belief propagation decoding. To analyze non-binary LDPC codes defined over both general linear group GL(m, F2) and finite field F2m, we investigate non-binary LDPC codes defined over GL(m3, F2m4). We propose a method to lower the error floors for non-binary LDPC codes. In this analysis, we see that the optimized non-binary LDPC codes defined over general linear group have the same decoding performance in the error floors as those defined over finite field. The non-binary LDPC codes defined over general linear group have more choices of the labels in the edges which satisfy the condition for the optimization.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2012•5 citations
In this paper, we compare the decoding error rates in the error floors for non-binary low-density parity-check (LDPC) codes over general linear groups with those for non-binary LDPC codes over finite fields transmitted through the q-ary memoryless symmetric channels under belief propagation decoding.To analyze non-binary LDPC codes defined over both the general linear group GL(m, F 2 ) and the finite field F 2 m , we investigate non-binary LDPC codes defined over GL(m 3 , F 2 m 4 ).We propose a method to lower the error floors for non-binary LDPC codes.In this analysis, we see that the non-binary LDPC codes constructed by our proposed method defined over general linear group have the same decoding performance in the error floors as those defined over finite field.The non-binary LDPC codes defined over general linear group have more choices of the labels on the edges which satisfy the condition for the optimization.
In this paper, we compare the decoding error rates in the error floors for non-binary low-density parity-check (LDPC) codes over the general linear group with those for non-binary LDPC codes over finite field transmitted over the q-ary memoryless symmetric channel under belief propagation decoding. To analyze non-binary LDPC codes defined over both general linear group GL(m, F2) and finite field F2m, we investigate non-binary LDPC codes defined over GL(m3, F2m4). We propose a method to lower the error floors for non-binary LDPC codes. In this analysis, we see that the optimized non-binary LDPC codes defined over general linear group have the same decoding performance in the error floors as those defined over finite field. The non-binary LDPC codes defined over general linear group have more choices of the labels in the edges which satisfy the condition for the optimization.