GitHub

kapilpalanisamy/Comparative-Study-of-GCD-Algorithms-in-Multiple-Languages-Euclidean-and-Stein-s-algorithms

Overview: This project benchmarks and compares six methods for computing the greatest common divisor (GCD): Euclidean Iterative, Euclidean Recursive, Stein’s Iterative, Stein’s Recursive, Subtraction ...
GitHub

A high-performance implementation of the greatest common divisor (GCD) algorithm that combines binary GCD with Lehmer's algorithm for optimal performance on large integers.

This library provides an efficient implementation of GCD computation that scales well from small integers to very large numbers. The algorithm uses different strategies based on the size of the input ...
IEEE

A Universal List Decoding Algorithm With Application to Decoding of Polar Codes

Abstract: This paper is concerned with a guessing codeword decoding (GCD) of linear block codes, which is optimal and typically requires a fewer number of searches than the naive exhaustive search ...
IEEE

Ordered Reliability Bits Guessing Codeword Decoding of Short Codes

Abstract: In this letter, we investigate the guessing codeword decoding (GCD) algorithm and the guessing noise decoding (GND) algorithm for short codes, revealing the universality (in terms of code ...