Search Results - bounded distance decoding algorithm*

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding

Authors: Divesh Aggarwal Yanlin Chen Rajendra Kumar et al.

Source: SIAM Journal on Computing. 54:233-278

Subject Terms: FOS: Computer and information sciences, Data Structures and Algorithms, Cryptography and Security, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Cryptography and Security (cs.CR)

Access URL: http://arxiv.org/abs/2002.07955

Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding

Authors: Aggarwal, D. (Divesh) Chen, Y. (Yanlin) Kumar, R. (Rajendra) et al.

Source: SIAM Journal on Computing vol. 54 no. 2, pp. 233-278

Index Terms: Lattices, Shortest vector problem, Discrete Gaussian sampling, Time-space tradeoff, Quantum computation, Bounded distance decoding, info:eu-repo/semantics/article

URL: https://ir.cwi.nl/pub/35122

improved provable algorithms for the shortest vector problem via bounded distance decoding

Authors: Rajendra Kumar Yixin Shen Divesh Aggarwal et al.

Contributors: Rajendra Kumar Yixin Shen Divesh Aggarwal et al.

Subject Terms: Shortest Vector Problem, Quantum computation, Lattices, Bounded distance decoding, [INFO] Computer Science [cs], ddc:004, Time-Space Tradeoff, Discrete Gaussian Sampling

File Description: application/pdf

Access URL: https://dblp.uni-trier.de/db/journals/corr/corr2002.html#abs-2002-07955
https://drops.dagstuhl.de/opus/volltexte/2021/13649/pdf/LIPIcs-STACS-2021-4.pdf/
https://hal.archives-ouvertes.fr/hal-03363367/document
https://drops.dagstuhl.de/opus/volltexte/2021/13649/
https://arxiv.org/pdf/2002.07955
https://hal.archives-ouvertes.fr/hal-03363367
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.4

Quantum and Classical Algorithms for Bounded Distance Decoding

Authors: Allen, Richard Berker, Ratip Emin Casacuberta, Sílvia et al.

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Quantum Physics, Computer Science - Data Structures and Algorithms, FOS: Physical sciences, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 0101 mathematics, Computational Complexity (cs.CC), Quantum Physics (quant-ph), 01 natural sciences

Access URL: http://arxiv.org/abs/2203.05019

Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding

Authors: Divesh Aggarwal and Yanlin Chen and Rajendra Kumar and Yixin Shen Aggarwal, Divesh Chen, Yanlin et al.

Index Terms: Lattices, Shortest Vector Problem, Discrete Gaussian Sampling, Time-Space Tradeoff, Quantum computation, Bounded distance decoding, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.4
Is Part Of LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)

An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding

Authors: T. Nishijima Shigeichi Hirasawa T. Kaneko

Source: IEEE Transactions on Information Theory. 43:1314-1319

Subject Terms: block codes, 0508 media and communications, Decoding, hard-decision bounded-distance decoding, 05 social sciences, decoding time complexity, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, soft-decision maximum-likelihood decoding algorithm, space complexity

File Description: application/xml

Access URL: https://ieeexplore.ieee.org/document/605601/
https://dblp.uni-trier.de/db/journals/tit/tit43.html#KanekoNH97

Hardness of Bounded Distance Decoding on Lattices in $\ell_p$ Norms

Authors: Bennett, Huck Peikert, Chris Huck Bennett and Chris Peikert

Contributors: Bennett, Huck Peikert, Chris Huck Bennett and Chris Peikert

Subject Terms: FOS: Computer and information sciences, Lattices, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Fine-Grained Complexity, Bounded Distance Decoding, Computer Science - Data Structures and Algorithms, NP-hardness, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2003.07903
https://drops.dagstuhl.de/opus/volltexte/2020/12588/
http://ui.adsabs.harvard.edu/abs/2020arXiv200307903B/abstract
http://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-07903
https://arxiv.org/abs/2003.07903
https://doi.org/10.4230/LIPIcs.CCC.2020.36
https://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-07903
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.36

Bounded Distance Decoding for Random Lattices

Authors: Gao, Shuhong

Subject Terms: FOS: Computer and information sciences, 68Q25 (primary), 11H06 (secondary), Computational Complexity, Computational Complexity (cs.CC), F.2.2

Access URL: http://arxiv.org/abs/2506.16662

Bounded-distance decoding: algorithms, decision regions, and pseudo nearest neighbors

Authors: Yair Be'ery Ofer Amrani

Source: IEEE Transactions on Information Theory. 44:3072-3082

Subject Terms: 0508 media and communications, nearest neighbors, Decoding, Voronoi region, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, decision region, 02 engineering and technology, bounded-distance decoding

File Description: application/xml

Access URL: http://ieeexplore.ieee.org/document/737536/
https://ieeexplore.ieee.org/document/737536/
https://dblp.uni-trier.de/db/journals/tit/tit44.html#AmraniB98
https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=737536

A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient

Authors: Chun Wang K.K. Tzeng Ba-Zhong Shen

Source: IEEE Transactions on Information Theory. 42:1987-1991

Subject Terms: generalized minimum distance decoding, Gaussian noise channels, Decoding, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Linear codes (general theory), bounded-distance decoding, decoding complexity, effective error coefficient, errors-and-erasures decoding

File Description: application/xml

Access URL: https://zbmath.org/1004609
https://doi.org/10.1109/18.556690
https://ieeexplore.ieee.org/document/556690/
https://dblp.uni-trier.de/db/journals/tit/tit42.html#ShenTW96
http://ieeexplore.ieee.org/document/556690/

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding

Authors: Aggarwal, Divesh Chen, Yanlin Kumar, Rajendra et al.

Index Terms: Computer Science - Data Structures and Algorithms, Computer Science - Cryptography and Security, text

URL: http://arxiv.org/abs/2002.07955

Novel High-Throughput Decoding Algorithms for Product and Staircase Codes Based on Error-and-Erasure Decoding

Authors: Alireza Sheikh Alexandre Graell i Amat Alex Alvarado

Source: Journal of Lightwave Technology

Subject Terms: FOS: Computer and information sciences, forward error correction, Computer Science - Information Theory, Information Theory (cs.IT), coded modulation, Bounded distance decoding, 02 engineering and technology, low-density parity-check codes, error and erasure decoding, hard-decision decoding, 0202 electrical engineering, electronic engineering, information engineering, product codes, staircase codes, high-throughput fiber-optic communications

Access URL: http://arxiv.org/pdf/2008.02181
http://arxiv.org/abs/2008.02181
https://arxiv.org/pdf/2008.02181.pdf
https://ui.adsabs.harvard.edu/abs/2020arXiv200802181S/abstract
https://arxiv.org/abs/2008.02181
https://dblp.uni-trier.de/db/journals/corr/corr2008.html#abs-2008-02181
https://www.osapublishing.org/jlt/abstract.cfm?uri=jlt-39-15-4909
https://arxiv.org/pdf/2008.02181
https://arxiv.org/abs/2008.02181
https://research.chalmers.se/en/publication/524430
https://ieeexplore.ieee.org/document/9426409/?arnumber=9426409

IMPROVED CLASSICAL AND QUANTUM ALGORITHMS FOR THE SHORTEST VECTOR PROBLEM VIA BOUNDED DISTANCE DECODING.

Authors: AGGARWAL, DIVESH YANLIN CHEN KUMARS, RAJENDRA et al.

Source: SIAM Journal on Computing; 2025, Vol. 54 Issue 2, p233-278, 46p

Subject Terms: TIME complexity, RANDOM access memory, QUANTUM computing, ISOMORPHISM (Mathematics), ALGORITHMS

Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding

Authors: Liu, S Ling, C Stehle, D et al.

Contributors: Liu, S Ling, C Stehle, D et al.

Source: IEEE Transactions on Information Theory. 57:5933-5945

Subject Terms: FOS: Computer and information sciences, 0508 media and communications, Mathematics - Number Theory, [SPI] Engineering Sciences [physics], Computer Science - Information Theory, Information Theory (cs.IT), 05 social sciences, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Number Theory (math.NT), 02 engineering and technology, [INFO] Computer Science [cs]

Access URL: http://arxiv.org/pdf/1003.0064
http://arxiv.org/abs/1003.0064
https://arxiv.org/abs/1003.0064
https://128.84.21.199/abs/1003.0064?context=math
https://ui.adsabs.harvard.edu/abs/2010arXiv1003.0064L/abstract
https://arxiv.org/pdf/1003.0064
https://www.arxiv-vanity.com/papers/1003.0064/
http://dblp.uni-trier.de/db/journals/tit/tit57.html#LiuLS11
https://spiral.imperial.ac.uk/bitstream/10044/1/15354/2/IEEE%20Transactions%20on%20Information%20Theory_57_9_2011.pdf
https://spiral.imperial.ac.uk/handle/10044/1/15354
https://hal.archives-ouvertes.fr/hal-00640634
https://dblp.uni-trier.de/db/journals/tit/tit57.html#LiuLS11
http://hdl.handle.net/10044/1/15354

A Soft-Decision Recursive Decoding Algorithm Using Iterative Bounded-Distance Decoding for u|u+v Codes

Authors: Hitoshi Tokushige

Source: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :996-1000

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: https://dblp.uni-trier.de/db/journals/ieicet/ieicet97a.html#Tokushige14
http://ci.nii.ac.jp/naid/130003394820
https://search.ieice.org/bin/summary.php?id=e97-a_4_996
http://dblp.uni-trier.de/db/journals/ieicet/ieicet97a.html#Tokushige14
http://ui.adsabs.harvard.edu/abs/2014IEITF..97..996T/abstract

Chase-3-like algorithms achieving bounded-distance decoding

Authors: Tingsu Yan Yuansheng Tang Ming Chen

Source: 2009 Fourth International Workshop on Signal Design and its Applications in Communications. :80-83

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005346444

A Note on Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding

Authors: Xinmei Huang Yuansheng Tang

Source: IEEE Transactions on Information Theory. 55:1047-1050

Subject Terms: 0508 media and communications, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: https://ieeexplore.ieee.org/document/4787631/
https://www.infona.pl/resource/bwmeta1.element.ieee-art-000004787631
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004787631
https://dblp.uni-trier.de/db/journals/tit/tit55.html#TangH09

Low-complexity chase-like bounded-distance decoding algorithms

Authors: Jos H. Weber

Source: GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489). :1608-1612

Subject Terms: 0508 media and communications, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: https://ieeexplore.ieee.org/document/1258509/
https://dblp.uni-trier.de/db/conf/globecom/globecom2003.html#Weber03

Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding

Authors: Weber, J.H. (author) Fossorier, M.P.C. (author)

Source: IEEE Transactions on Information Theory. 50:3318-3323

Subject Terms: 0508 media and communications, 4. Education, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 7. Clean energy

Access URL: https://repository.tudelft.nl/islandora/object/uuid%3A06bec593-c14d-4ac4-95cf-b5036bd79b7b/datastream/OBJ/download
http://repository.tudelft.nl/assets/uuid:06bec593-c14d-4ac4-95cf-b5036bd79b7b/ieee_weber_2004.pdf
https://ieeexplore.ieee.org/document/1362918/
https://repository.tudelft.nl/islandora/object/uuid%3A06bec593-c14d-4ac4-95cf-b5036bd79b7b/datastream/OBJ/download
https://dblp.uni-trier.de/db/journals/tit/tit50.html#WeberF04
https://www.narcis.nl/publication/RecordID/oai%3Atudelft.nl%3Auuid%3A06bec593-c14d-4ac4-95cf-b5036bd79b7b
http://ieeexplore.ieee.org/document/1362918/
http://resolver.tudelft.nl/uuid:06bec593-c14d-4ac4-95cf-b5036bd79b7b

Improved Decoding of Staircase Codes: The Soft-Aided Bit-Marking (SABM) Algorithm: the soft-aided bit-marking (SABM) algorithm

Authors: Yi Lei Bin Chen Gabriele Liga et al.

Source: IEEE Transactions on Communications

Subject Terms: Signal Processing (eess.SP), Optical communication systems, FOS: Electrical engineering, electronic engineering, information engineering, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, eess.SP, product codes, 02 engineering and technology, staircase codes, Electrical Engineering and Systems Science - Signal Processing, iterative bounded distance decoding, marked bits

Access URL: https://pure.tue.nl/ws/files/144961451/08856224.pdf
http://arxiv.org/abs/1902.01178
https://jglobal.jst.go.jp/en/detail?JGLOBAL_ID=202002249433549719
https://arxiv.org/abs/1902.01178
https://ieeexplore.ieee.org/document/8856224
https://research.tue.nl/en/publications/improved-decoding-of-staircase-codes-the-soft-aided-bit-marking-s
http://ui.adsabs.harvard.edu/abs/2019arXiv190201178L/abstract
https://pure.tue.nl/ws/files/118100477/1902.01178v1.pdf