Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (Q375966): Difference between revisions

@@ 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 @@
+Expander codes
@@ Property / cites work: Expander codes / rank @@
+Normal rank
@@ Property / cites work @@
+Ramanujan graphs
@@ Property / cites work: Ramanujan graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4071451
@@ Property / cites work: Q4071451 / rank @@
+Normal rank
@@ Property / cites work @@
+On expander codes
@@ Property / cites work: On expander codes / rank @@
+Normal rank
@@ Property / cites work @@
+Distance properties of expander codes
@@ Property / cites work: Distance properties of expander codes / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds on the rate of LDPC codes as a function of minimum distance
+Normal rank
@@ Property / cites work @@
+Improved Nearly-MDS Expander Codes
@@ Property / cites work: Improved Nearly-MDS Expander Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q5665102
@@ Property / cites work: Q5665102 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5675263
@@ Property / cites work: Q5675263 / rank @@
+Normal rank
@@ Property / cites work @@
+New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
+Normal rank
@@ Property / cites work @@
+Weight distribution and decoding of codes on hypergraphs
+Normal rank