Suchergebnisse - "Combinatorial coding theory"
-
1
-
2
-
3
-
4
Autoren: International Worskshop on Algebraic and Combinatorial Coding Theory (12 ; 2010 ; Nowosybirsk).
Quelle: Bibliogr. przy pracach.
-
5
Autoren:
Weitere Verfasser:
Quelle: Bibliogr. s. [91-93]. Indeks.
Schlagwörter: Kodowanie (informatyka), Rozwinięcia asymptotyczne
-
6
-
7
Autoren: Alexander Vardy
Quelle: 2006 IEEE International Symposium on Information Theory. :xliii-xliii
Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 0101 mathematics, 01 natural sciences
-
8
-
9
Autoren: Zierler, Neal
Quelle: SIAM Review, 1978 Jul 01. 20(3), 607-608.
Relation: An Introduction to Algebraic and Combinatorial Coding Theory. Ian F. Blake Ronald C. Mullin
Zugangs-URL: https://www.jstor.org/stable/2030371
-
10
Autoren: Neal Zierler
Quelle: SIAM Review. 20:607-608
Schlagwörter: 0103 physical sciences, 0101 mathematics, 01 natural sciences
-
11
Autoren:
Quelle: Journal of Algebraic Combinatorics; Nov2025, Vol. 62 Issue 3, p1-24, 24p
-
12
-
13
Autoren:
Weitere Verfasser:
Dateibeschreibung: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.637.6928; http://www.moi.math.bas.bg/acct2008/b20.pdf
-
14
Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives
Schlagwörter: self-dual codes, tail-biting trellises, necklace factor graph
Dateibeschreibung: application/pdf
-
15
Autoren: E.L. Monte Carmelo
Quelle: European Journal of Combinatorics. 22:351-356
Schlagwörter: Combinatorial codes, Hamming distance, Computational Theory and Mathematics, Zarankiewicz numbers, combinatorial coding theory, Geometry and Topology, 0102 computer and information sciences, Partition relations, 0101 mathematics, polarized partition relations, 01 natural sciences, Theoretical Computer Science
Dateibeschreibung: application/xml
-
16
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 2020 Algebraic and Combinatorial Coding Theory (ACCT)
Schlagwörter: flash memories, phase change memories, defect memory, (partially) stuck cells, defective cells error correction, sphere packing bound, Gilbert-Varshamov bound, FOS: Computer and information sciences, Computer Science - Information Theory, Information Theory (cs.IT), Computer Science - Data Structures and Algorithms, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 02 engineering and technology, 01 natural sciences, ddc
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/pdf/2009.06512
http://arxiv.org/abs/2009.06512
https://arxiv.org/abs/2009.06512
https://arxiv.org/pdf/2009.06512
https://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-06512
http://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-06512
https://mediatum.ub.tum.de/1595206
https://mediatum.ub.tum.de/doc/1595172/document.pdf -
17
Autoren:
Index Begriffe: linear code, divisible code, projective dual, Conference Paper, AM
-
18
Autoren:
Index Begriffe: linear code, Griesmer bound, projective dual, Conference Paper, AM
-
19
Autoren: Polyanskiy, Yury1
Quelle: IEEE Transactions on Information Theory. Mar2016, Vol. 62 Issue 3, p1119-1128. 10p.
Schlagwörter: *LINEAR programming, *BINARY codes, *SUPERPOSITION (Optics), *MATHEMATICAL bounds, *DECODING algorithms, *HAMMING distance
-
20
Autoren: et al.
Quelle: IEEE Transactions on Information Theory; Jun2019, Vol. 65 Issue 6, p3738-3750, 13p
Nájsť tento článok vo Web of Science
Full Text Finder