Výsledky vyhledávání - bounded distance decoding (problem OR problemys)*

On the List and Bounded Distance Decodability of ReedSolomon Codes

Autoři: Cheng, Qi Wan, Daqing

Zdroj: SIAM Journal on Computing. 37(1)

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: https://escholarship.org/uc/item/8wc6425s
https://escholarship.org/content/qt8wc6425s/qt8wc6425s.pdf

On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications

Autoři: Li, Zhe Ling, San Xing, Chaoping a další

Přispěvatelé: Li, Zhe Ling, San Xing, Chaoping a další

Zdroj: IEEE Transactions on Information Theory. 66:2588-2598

Témata: 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]

Popis souboru: application/pdf

Přístupová URL adresa: 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

Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices

Autoři: Bai, Shi Stehlé, Damien Wen, Weiqiang a další

Přispěvatelé: Bai, Shi Stehlé, Damien Wen, Weiqiang a další

Témata: Bounded Distance Decoding Problem, Sparsification, Unique Shortest Vector Problem, Lattices, ddc:004, [INFO] Computer Science [cs]

Popis souboru: application/pdf

Přístupová URL adresa: https://inria.hal.science/hal-01394213v1
https://doi.org/10.4230/lipics.icalp.2016.76
https://dblp.uni-trier.de/db/conf/icalp/icalp2016.html#BaiSW16
https://drops.dagstuhl.de/opus/volltexte/2016/6208/
https://drops.dagstuhl.de/opus/volltexte/2016/6208/pdf/LIPIcs-ICALP-2016-76.pdf/
https://hal.inria.fr/hal-01394213
https://doi.org/10.4230/LIPIcs.ICALP.2016.76
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.76

On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract)

Autoři: Cheng, Qi Wan, Daqing

Zdroj: SIAM Journal on Computing, vol 37, iss 1

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: 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

Exploring Trade-offs in Batch Bounded Distance Decoding

Autoři: Albrecht, Martin R. Curtis, Benjamin R. Wunderer, Thomas

Zdroj: 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 2019

Přístupová URL adresa: 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

NP-HARDNESS OF REED-SOLOMON DECODING, AND THE PROUHET-TARRY-ESCOTT PROBLEM.

Autoři: GANDIKOTA, VENKATA GHAZI, BADIH GRIGORESCU, ELENA

Zdroj: SIAM Journal on Computing. 2018, Vol. 47 Issue 4, p1547-1584. 38p.

Témata: *APPROXIMATION theory, *NUMERICAL analysis, *INFORMATION theory, *MATHEMATICAL models, *MATHEMATICAL analysis

On Bounded Distance Decoding for General Lattices.

Autoři: Díaz, Josep Jansen, Klaus Rolim, José D. P. a další

Zdroj: Approximation, Randomization & Combinatorial Optimization. Algorithms & Techniques (9783540380443); 2006, p450-461, 12p

Using Variational Quantum Algorithm to Solve the LWE Problem.

Autoři: Lv, Lihui Yan, Bao Wang, Hong a další

Zdroj: Entropy; Oct2022, Vol. 24 Issue 10, p1428-N.PAG, 16p

Témata: PROBLEM solving, ALGORITHMS, APPROXIMATION algorithms, MATHEMATICAL optimization, DECODING algorithms, QUBITS

On the NP-hardness of bounded distance decoding of Reed-Solomon codes

Autoři: Badih Ghazi Venkata Gandikota Elena Grigorescu

Zdroj: 2015 IEEE International Symposium on Information Theory (ISIT).

Témata: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, 3. Good health

Přístupová URL adresa: https://dblp.uni-trier.de/db/conf/isit/isit2015.html#GandikotaGG15
https://ieeexplore.ieee.org/document/7282988/
http://people.csail.mit.edu/badih/papers/RS-NPHard.pdf
https://www.cs.purdue.edu/homes/egrigore/papers/RS-NPHard-ISITs.pdf

On Bounded Distance Decoding for General Lattices

Autoři: Vadim Lyubashevsky Daniele Micciancio Yi-Kai Liu

Zdroj: Lecture Notes in Computer Science ISBN: 9783540380443

Accurate Score Prediction for Dual-Sieve Attacks.

Autoři: Ducas, Léo Pulles, Ludo N.

Zdroj: Journal of Cryptology; Jan2026, Vol. 39 Issue 1, p1-51, 51p

Improved analysis of the reduction from BDD to uSVP.

Autoři: Zhao, Chunhuan Zheng, Zhongxiang

Zdroj: Information Processing Letters. Aug2019, Vol. 148, p28-32. 5p.

Témata: LATTICE constants, MATHEMATICAL equivalence, EMBEDDINGS (Mathematics)

Contribuciones al reconocimiento robusto de habla

Autoři: 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

Témata: Reconocimiento de voz, Reconocimiento del habla, Robótica e Informática Industrial

Přístupová URL adresa: http://hdl.handle.net/10016/2466

Two-stage memetic algorithm for green flexible job shop scheduling problem considering machine deterioration and maintenance.

Autoři: Zhu, Guoqiang Liu, Jianfeng Gong, Wenyin

Zdroj: Memetic Computing; Jun2025, Vol. 17 Issue 2, p1-33, 33p

Cool + Cruel = Dual, and new benchmarks for sparse LWE

Autoři: Karenin, A. (Alexander) Kirshanova, E. (Elena) Nowakowski, J. (Julian) a další

Témata: Bounded distance decoding, Cryptanalysis, Sparse LWE

Popis souboru: application/pdf

Relation: info:eu-repo/grantAgreement/EC/H2020/947821; https://ir.cwi.nl/pub/35807

Dostupnost: https://ir.cwi.nl/pub/35807

Synaptic facilitation and learning of multiplexed neural signals.

Autoři: Crook, Nigel Rast, Alexander D. Elia, Eleni a další

Zdroj: Frontiers in Network Physiology; 2025, p1-16, 16p

A knowledge-driven memetic algorithm for energy-aware flexible job shop scheduling with limited AGV transportation.

Autoři: Huo, Yajie Zhang, Fayong Gong, Wenyin

Zdroj: Memetic Computing; Mar2026, Vol. 18 Issue 1, p1-19, 19p

Retrieving and reconstructing conceptually similar images from fMRI with latent diffusion models and a neuro-inspired brain decoding model.

Autoři: Ferrante, Matteo Boccato, Tommaso Passamonti, Luca a další

Zdroj: Journal of Neural Engineering; Aug2024, Vol. 21 Issue 4, p1-20, 20p

ALMOST PERFECT LATTICES, THE COVERING RADIUS PROBLEM, AND APPLICATIONS TO AJTAI'S CONNECTION FACTOR.

Zdroj: SIAM Journal on Computing; 2004, Vol. 34 Issue 1, p118-169, 52p

Témata: LATTICE theory, NUMERICAL calculations, CRYPTOGRAPHY, MATHEMATICS, RADIUS (Geometry), ABSTRACT algebra, PHONOLOGICAL decoding, CONVEX bodies

People: AJTAI, Miklos

Reproducing the Few-Shot Learning Capabilities of the Visual Ventral Pathway Using Vision Transformers and Neural Fields.

Autoři: Su, Jiayi Xing, Lifeng Li, Tao a další

Zdroj: Brain Sciences (2076-3425); Aug2025, Vol. 15 Issue 8, p882, 15p

Témata: VISUAL pathways, MACHINE learning, MATHEMATICAL models, ASSOCIATIVE learning, RECOGNITION (Psychology), TRANSFORMER models, ARTIFICIAL neural networks