Lower bound for the linear multiple packing of the binary Hamming space (Q1586134): Difference between revisions

@@ Property / DOI @@
-.1006/jcta.1999.3053
@@ Property / DOI: 10.1006/jcta.1999.3053 / rank @@
-Normal rank
@@ Property / author @@
-Vladimir Blinovsky
@@ Property / author: Vladimir Blinovsky / rank @@
-Normal rank
@@ Property / author @@
+Vladimir Blinovsky
@@ Property / author: Vladimir Blinovsky / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/jcta.1999.3053
+Normal rank
@@ Property / OpenAlex ID @@
+W2016360377
@@ Property / OpenAlex ID: W2016360377 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for codes in the case of list decoding of finite volume
+Normal rank
@@ Property / cites work @@
+Q4360249
@@ Property / cites work: Q4360249 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bound on error probability in fixed-volume list decoding
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved lower bounds on the sizes of error-correcting codes for list decoding
+Normal rank
@@ Property / DOI @@
+.1006/JCTA.1999.3053
@@ Property / DOI: 10.1006/JCTA.1999.3053 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1586134