Suchergebnisse - "Binary GCD algorithm"

Binary GCD Algorithm

Quelle: Encyclopedia of Cryptography, Security and Privacy ISBN: 9783030715205

Existence of a limiting distribution for the binary GCD algorithm

Autoren: Gérard Maze

Quelle: Journal of Discrete Algorithms. 5:176-186

Schlagwörter: Binary gcd algorithm, Fixed point, 0102 computer and information sciences, 01 natural sciences, Theoretical Computer Science, Functional Analysis (math.FA), 68W40, 68Q25, 47H10, Mathematics - Functional Analysis, Computational Theory and Mathematics, General Mathematics (math.GM), 0103 physical sciences, FOS: Mathematics, Discrete Mathematics and Combinatorics, Analysis of algorithms, Mathematics - General Mathematics

Zugangs-URL: http://arxiv.org/abs/math/0504426
https://dblp.uni-trier.de/db/journals/jda/jda5.html#Maze07
https://core.ac.uk/display/82094294
https://www.sciencedirect.com/science/article/pii/S157086670600027X
http://user.math.uzh.ch/maze/Articles/BrentArxiv.pdf

Analysis of a left-shift binary GCD algorithm

Autoren: Shallit, Jeffrey Sorenson, Jonathan

Quelle: Lecture Notes in Computer Science ISBN: 9783540586913

Schlagwörter: Computational Mathematics, Algebra and Number Theory, Theory and Algorithms, binary GCD algorithm, Analysis of algorithms and problem complexity, Number Theory, Multiplicative structure, Euclidean algorithm, greatest common divisors, 0102 computer and information sciences, 0101 mathematics, complexity, 01 natural sciences, Number-theoretic algorithms

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0747717184710303
https://digitalcommons.butler.edu/facsch_papers/1339/
https://dblp.uni-trier.de/db/journals/jsc/jsc17.html#ShallitS94
https://core.ac.uk/display/82485981
https://www.sciencedirect.com/science/article/abs/pii/S0747717184710303
https://link.springer.com/chapter/10.1007/3-540-58691-1_55
https://rd.springer.com/chapter/10.1007%2F3-540-58691-1_55
https://link.springer.com/content/pdf/10.1007%2F3-540-58691-1_55.pdf
https://dblp.uni-trier.de/db/conf/ants/ants1994.html#ShallitS94

(1 +i) - ary GCD Computation inZ[ i ]as an Analogue to the Binary GCD Algorithm

Autoren: André Weilert

Quelle: Journal of Symbolic Computation. 30:605-617

Schlagwörter: Computational Mathematics, Algebra and Number Theory, 0101 mathematics, 01 natural sciences

Zugangs-URL: https://dblp.uni-trier.de/db/journals/jsc/jsc30.html#Weilert00
https://dialnet.unirioja.es/servlet/articulo?codigo=711638
https://dl.acm.org/doi/10.1006/jsco.2000.0422
https://www.sciencedirect.com/science/article/abs/pii/S074771710090422X
https://www.sciencedirect.com/science/article/pii/S074771710090422X
https://core.ac.uk/display/82515504

A generalization of the binary GCD algorithm

Autoren: Tudor Jebelean

Quelle: Proceedings of the 1993 international symposium on Symbolic and algebraic computation - ISSAC '93. :111-116

Schlagwörter: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Binary GCD Algorithm

Quelle: Encyclopedia of Cryptography and Security ISBN: 9781441959058

FPGA Implementation of an Extended Binary GCD Algorithm for Systolic Reduction of Rational Numbers

Autoren: Tudor Jebelean Bogdan Matasaru

Quelle: Lecture Notes in Computer Science ISBN: 9783540678991

Zugangs-URL: https://link.springer.com/chapter/10.1007%2F3-540-44614-1_91
https://link.springer.com/content/pdf/10.1007%2F3-540-44614-1_91.pdf
https://rd.springer.com/chapter/10.1007/3-540-44614-1_91
https://dblp.uni-trier.de/db/conf/fpl/fpl2000.html#MatasaruJ00
https://doi.org/10.1007/3-540-44614-1_91

Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding

Autoren: Francisco Argüello

Quelle: Electronics Letters. 41:754-755

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: http://ieeexplore.ieee.org/xpl/abstractAuthors.jsp?reload=true&arnumber=1459884
https://ui.adsabs.harvard.edu/abs/2005ElL....41..754A/abstract
https://digital-library.theiet.org/content/journals/10.1049/el_20050769
http://ieeexplore.ieee.org/document/1459884/

Existence of a limiting distribution for the binary GCD algorithm

Autoren: Maze, Gérard¹ gmaze@math.unizh.ch

Quelle: Journal of Discrete Algorithms. Mar2007, Vol. 5 Issue 1, p176-186. 11p.

Schlagwörter: Distribution (Probability theory), Binary number system, Algorithms

People: Brent, Richard

Existence of a Limiting Distribution for the Binary GCD Algorithm ∗

Autoren: Gérard Maze The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Gérard Maze The Pennsylvania State University CiteSeerX Archives

Quelle: http://arxiv.org/pdf/math/0504426v1.pdf.

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.240.7861; http://arxiv.org/pdf/math/0504426v1.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.240.7861
http://arxiv.org/pdf/math/0504426v1.pdf

Extending the binary GCD algorithm

Autoren: Graham H. Norton

Quelle: Lecture Notes in Computer Science ISBN: 9783540167761

Zugangs-URL: https://link.springer.com/chapter/10.1007%2F3-540-16776-5_741
https://rd.springer.com/chapter/10.1007/3-540-16776-5_741
https://dblp.uni-trier.de/db/conf/aaecc/aaecc1985.html#Norton85

An analysis of the generalized binary GCD algorithm

Autoren: Jonathan P. Sorenson The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Jonathan P. Sorenson The Pennsylvania State University CiteSeerX Archives

Quelle: http://euclid.butler.edu/~sorenson/papers/genbin.pdf.

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.1142; http://euclid.butler.edu/~sorenson/papers/genbin.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.1142
http://euclid.butler.edu/~sorenson/papers/genbin.pdf

Analysis of Another Left Shift Binary GCD Algorithm

Autoren: Chen, Yan-heng

Thesis Advisors: Chun-I Fan, Chia-Mei Chen, D. J. Guan

Schlagwörter: Self-test, Modular inverse, GCD

Dateibeschreibung: application/pdf

Verfügbarkeit: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0714109-121741

Analysis of Another Left Shift Binary GCD Algorithm

另一種左移最大公因數演算法的分析

Autoren: Yan-heng Chen 陳彥亨

Thesis Advisors: Yan-heng Chen 陳彥亨

Dateibeschreibung: 40

Verfügbarkeit: http://ndltd.ncl.edu.tw/handle/c23hr9

On Acceleration of the k-ary GCD Algorithm

Autoren: Amer I. Ishmukhametov S.

Quelle: Учёные записки Казанского университета: Серия Физико-математические науки, Vol 161, Iss 1, Pp 110-118 (2019)
SCOPUS25417746-2019-161-1-SID85071981073

Schlagwörter: binary gcd algorithm, euclidian gcd algorithm, Euclidian GCD algorithm, greatest common divisor for natural numbers, K-ary GCD algorithm, QA1-939, Binary GCD algorithm, Greatest common divisor for natural numbers, Mathematics, k-ary gcd algorithm

Zugangs-URL: https://doaj.org/article/52eeec2e44064236878b486603fc9ac2
https://openrepository.ru/article?id=198656

An Analysis of the Generalized Binary GCD Algorithm

Autoren: Sorenson, Jonathan

Quelle: Scholarship and Professional Work - LAS

Schlagwörter: Mathematics

Relation: https://digitalcommons.butler.edu/facsch_papers/1346; https://works.bepress.com/jonathan_sorenson/20/download/

Verfügbarkeit: https://digitalcommons.butler.edu/facsch_papers/1346
https://doi.org/10.1090/fic/041
https://works.bepress.com/jonathan_sorenson/20/download/

Modulo q greatest common divisor algorithms

Autoren: Szabó, Sándor

Schlagwörter: binary gcd algorithm, extended gcd algorithm, 11A05, 11Y16

Relation: https://hdl.handle.net/10525/5874

Verfügbarkeit: https://hdl.handle.net/10525/5874

Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding.

Autoren: Argüello, F.

Quelle: Electronics Letters (Institution of Engineering & Technology); 6/23/2005, Vol. 41 Issue 13, p754-755, 2p

Schlagwörter: POLYNOMIALS, ALGORITHMS, REED-Solomon codes, ERROR-correcting codes, DIGITAL signal processing mathematics, ELECTRONICS

A generalization of the binary GCD algorithm.

Autoren: Jebelean, T.

Quelle: Proceedings of the 1993 International Symposium: Symbolic & Algebraic Computation; 8/1/1993, p111-116, 6p

New Modified Euclidean and Binary Greatest Common Divisor Algorithm.

Autoren: Tembhurne, Jitendra V. Sathe, Shailesh R.

Quelle: IETE Journal of Research; Dec2016, Vol. 62 Issue 6, p852-858, 7p

Schlagwörter: DIVISOR theory, EUCLIDEAN geometry, ARITHMETIC, CRYPTOGRAPHY, PARALLEL algorithms