New binary Euclidean algorithms

DOI10.1049/EL:19880583MaRDI QIDQ3033829zbMATH OpenOpenAlexFDO

Authors David M. Mandelbaum

Publication date 1988

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19880583

zbMATH Keywords

binary Euclidean algorithmsgreatest common divisor

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Radix representation; digital problems (11A63) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• New fast Euclidean algorithms
• The mixed binary Euclid algorithm
• scientific article; zbMATH DE number 3581610
• scientific article; zbMATH DE number 1186933
• Generalized Euclidean algorithms
• scientific article; zbMATH DE number 940712
• Euclid-type algorithm and its applications
• Acceleration of Euclidean algorithm and extensions
• Extended Euclidean algorithm and CRT algorithm

Cited in

(8)

• Analysis of a left-shift binary GCD algorithm
• New fast Euclidean algorithms
• scientific article; zbMATH DE number 4006333 (Why is no real title available?)
• scientific article; zbMATH DE number 4031770 (Why is no real title available?)
• scientific article; zbMATH DE number 1186933 (Why is no real title available?)
• Two Fast GCD Algorithms
• Performance of a GCD algorithm for Gaussian integers
• Algorithmic Number Theory

This page was built for publication: New binary Euclidean algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033829)