# Correcting matrix products over the ring of integers

arXiv: https://arxiv.org/abs/2307.12513 · HTML: https://mlsanity.com/paper/2307.12513/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Jul 2023.

## Built on by (most cited first, 1 of 1)

- [Syndrome Decoding for Silent Data Corruption in Quantized Integer GPU Arithmetic](https://mlsanity.com/paper/2609.19743/) (2026)

## Abstract (arXiv)

Let A, B, and C be three n× n matrices. We investigate the problem of verifying whether AB=C over the ring of integers and finding the correct product AB. Given that C is different from AB by at most k entries, we propose an algorithm that uses O(√kn2+k2n) operations. Let α be the largest absolute value of an entry in A, B, and C. The integers involved in the computation are of O(n3α2).