An approach to the performance of SPC product codes on the erasure channel (Q259259): Difference between revisions

@@ Property / DOI @@
-.3934/amc.2016.10.11
@@ Property / DOI: 10.3934/amc.2016.10.11 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.3934/amc.2016.10.11
+Normal rank
@@ Property / OpenAlex ID @@
+W2324225289
@@ Property / OpenAlex ID: W2324225289 / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)
+Normal rank
@@ Property / cites work @@
+Recoverability study of SPC product codes under erasure decoding
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5747637
@@ Property / cites work: Q5747637 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3474660
@@ Property / cites work: Q3474660 / rank @@
+Normal rank
@@ Property / cites work @@
+Single parity check product codes
@@ Property / cites work: Single parity check product codes / rank @@
+Normal rank
@@ Property / DOI @@
+.3934/AMC.2016.10.11
@@ Property / DOI: 10.3934/AMC.2016.10.11 / rank @@
+Normal rank