Distributed matrix multiplication with straggler tolerance over very small fields

DOI10.1007/S10623-025-01689-7MaRDI QIDQ6909172zbMATH OpenFDO

Authors Adrián Fidalgo-Díaz, Umberto Martínez-Peñas

Publication date 30 October 2025

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10623-025-01689-7

zbMATH Keywords

distributed matrix multiplicationfootprint boundhyperbolic codesMinkowski sumReed-Muller codes

Mathematics Subject Classification ID

Distributed algorithms (68W15) Symbolic computation and algebraic computation (68W30) Linear codes (general theory) (94B05)

Cites work

• Attacking and Defending the McEliece Cryptosystem
• Footprints or generalized Bezout's theorem
• High dimensional affine codes whose square has a designed minimum distance
• scientific article; zbMATH DE number 2081133 (Why is no real title available?)
• Monomial-Cartesian codes closed under divisibility
• On products and powers of linear codes under componentwise multiplication
• On the Optimal Recovery Threshold of Coded Matrix Multiplication

This page was built for publication: Distributed matrix multiplication with straggler tolerance over very small fields

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