Vectorizing computations at decoding of nonbinary codes with small density of checks (Q507108): Difference between revisions

@@ Property / cites work @@
+Q5538637
@@ Property / cites work: Q5538637 / rank @@
+Normal rank
@@ Property / cites work @@
+A recursive approach to low complexity codes
@@ Property / cites work: A recursive approach to low complexity codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4132387
@@ Property / cites work: Q4132387 / rank @@
+Normal rank
@@ Property / cites work @@
+Good error-correcting codes based on very sparse matrices
+Normal rank
@@ Property / cites work @@
+On the error-correcting capability of LDPC codes
@@ Property / cites work: On the error-correcting capability of LDPC codes / rank @@
+Normal rank
@@ Property / cites work @@
+Erasure correction by low-density codes
@@ Property / cites work: Erasure correction by low-density codes / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of the relation between properties of LDPC codes and the Tanner graph
+Normal rank
@@ Property / cites work @@
+On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
+Normal rank
@@ Property / cites work @@
+Asymptotic estimation of the fraction of errors correctable by \(q\)-ary LDPC codes
+Normal rank
@@ Property / cites work @@
+Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
+Normal rank