Suchergebnisse - bounded distance decoding (problem OR (problemys OR (problemys OR problemys)))
-
1
Autoren:
Quelle: SIAM Journal on Computing. 37(1)
Schlagwörter: list decoding algorithm, bounded distance decoding algorithm, Reed-Solomon codes, discrete logarithm problem, math.NT, cs.IT, math.IT, 11Y16, 68Q25, Pure Mathematics, Computation Theory and Mathematics, Computation Theory & Mathematics
Dateibeschreibung: application/pdf
-
2
Autoren: et al.
Weitere Verfasser: et al.
Quelle: IEEE Transactions on Information Theory. 66:2588-2598
Schlagwörter: Trapdoor Function, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Closest Vector Problem, 01 natural sciences, Mathematics::Discrete mathematics::Cryptography [Science]
Dateibeschreibung: application/pdf
Zugangs-URL: https://dr.ntu.edu.sg/bitstream/10356/138650/2/polylattice.pdf
https://dr.ntu.edu.sg/bitstream/10356/138650/2/polylattice.pdf
https://ieeexplore.ieee.org/document/8961986
https://dblp.uni-trier.de/db/journals/tit/tit66.html#LiLXY20
https://dr.ntu.edu.sg/handle/10356/138650
https://hdl.handle.net/10356/138650 -
3
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Lattices, Bounded Distance Decoding Problem, Unique Shortest Vector Problem, Sparsification
Dateibeschreibung: application/pdf
Relation: Is Part Of LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.76
-
4
Autoren:
Quelle: Lecture Notes in Computer Science ISBN: 9783030384708
Selected Areas in Cryptography – SAC 2019-26th International Conference, Waterloo, ON, Canada, August 12–16, 2019, Revised Selected Papers
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Selected Areas in Cryptography – SAC 2019Zugangs-URL: https://link.springer.com/chapter/10.1007/978-3-030-38471-5_19
https://eprint.iacr.org/2019/1122
https://dblp.uni-trier.de/db/journals/iacr/iacr2019.html#MassartS19
https://rd.springer.com/chapter/10.1007/978-3-030-38471-5_19
http://dblp.uni-trier.de/db/conf/sacrypt/sacrypt2019.html#AlbrechtCW19 -
5
Autoren: Vicente Peña, Jesús de
Thesis Advisors: Díaz de María, Fernando, Universidad Carlos III de Madrid. Departamento de Teoría de la Señal y Comunicaciones
Zugangs-URL: http://hdl.handle.net/10016/2466
-
6
Autoren:
Quelle: SIAM Journal on Computing, vol 37, iss 1
Schlagwörter: discrete logarithm problem, Reed-Solomon codes, 68Q25, Computation Theory and Mathematics, 0102 computer and information sciences, 02 engineering and technology, 11Y16, Pure Mathematics, 01 natural sciences, bounded distance decoding algorithm, Computation Theory & Mathematics, math.NT, cs.IT, 0202 electrical engineering, electronic engineering, information engineering, math.IT, list decoding algorithm
Dateibeschreibung: application/pdf
Zugangs-URL: http://cr.yp.to/bib/2004/cheng-codes.pdf
https://epubs.siam.org/doi/10.1137/S0097539705447335
https://escholarship.org/uc/item/8wc6425s.pdf
https://doi.org/10.1137/S0097539705447335
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp37.html#ChengW07
https://locus.siam.org/doi/abs/10.1137/S0097539705447335
https://escholarship.org/uc/item/8wc6425s
http://www.math.uci.edu/~dwan/code.pdf
https://www.math.uci.edu/~dwan/listcode.pdf
https://ieeexplore.ieee.org/document/1366253/
https://www.cs.ou.edu/~qcheng/paper/ld.pdf
http://ieeexplore.ieee.org/document/1366253/
https://dblp.uni-trier.de/db/conf/focs/focs2004.html#ChengW04
https://escholarship.org/uc/item/8wc6425s -
7
Autoren:
Quelle: Journal of Cryptology; Jan2026, Vol. 39 Issue 1, p1-51, 51p
-
8
Autoren: et al.
Quelle: Entropy; Oct2022, Vol. 24 Issue 10, p1428-N.PAG, 16p
-
9
Autoren:
Quelle: SIAM Journal on Computing. 2018, Vol. 47 Issue 4, p1547-1584. 38p.
Schlagwörter: *APPROXIMATION theory, *NUMERICAL analysis, *INFORMATION theory, *MATHEMATICAL models, *MATHEMATICAL analysis
-
10
Autoren: et al.
Quelle: Frontiers in Network Physiology; 2025, p1-16, 16p
-
11
Autoren:
Quelle: Memetic Computing; Jun2025, Vol. 17 Issue 2, p1-33, 33p
-
12
Autoren: et al.
Quelle: Approximation, Randomization & Combinatorial Optimization. Algorithms & Techniques (9783540380443); 2006, p450-461, 12p
-
13
Autoren:
Quelle: Memetic Computing; Mar2026, Vol. 18 Issue 1, p1-19, 19p
-
14
Quelle: Journal of Maxillofacial & Oral Surgery; 2025 Suppl 1, Vol. 24, p1-484, 484p
-
15
Autoren: Sideri, Eleni
Quelle: Memory Studies; Dec2025, Vol. 18 Issue 6, p1381-1395, 15p
-
16
Autoren: et al.
Quelle: Health Information Science & Systems; 10/28/2025, Vol. 13 Issue 1, p1-17, 17p
-
17
Quelle: Journal of Extracellular Vesicles; Oct2025 Supplement 1, Vol. 14, p1-555, 555p
-
18
Quelle: Hepatology International; 2025 Suppl 1, Vol. 19, p1-1554, 1554p
-
19
Autoren: et al.
Quelle: Journal of Imaging; Oct2025, Vol. 11 Issue 10, p359, 29p
-
20
Autoren: et al.
Quelle: Brain Sciences (2076-3425); Aug2025, Vol. 15 Issue 8, p882, 15p
Full Text Finder
Nájsť tento článok vo Web of Science