An Iterative Euclidean Algorithm

DOI10.1007/3-540-51082-6_72MaRDI QIDQ3469039zbMATH OpenOpenAlexFDO

Authors Paul Camion

Publication date 1989

Published in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00075709

zbMATH Keywords

decoding binary BCH codesiterative Euclidean algorithm

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Coding theorems (Shannon theory) (94A24) Decoding (94B35)

Recommendations

• On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
• scientific article; zbMATH DE number 15442
• Computational Science - ICCS 2004
• On the equivalence of the Berlekamp-Massey and the Euclidean algorithms for decoding
• scientific article; zbMATH DE number 554520

Cited in

(4)

• The non-Euclidean Euclidean algorithm
• scientific article; zbMATH DE number 4006333 (Why is no real title available?)
• On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
• scientific article; zbMATH DE number 15442 (Why is no real title available?)

This page was built for publication: An Iterative Euclidean Algorithm

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