pith. machine review for the scientific record. sign in

arxiv: 2603.03723 · v3 · submitted 2026-03-04 · 💻 cs.IT · math.IT

Recognition: unknown

A New Class of Geometric Analog Error Correction Codes for Crossbar Based In-Memory Computing

Authors on Pith no claims yet
classification 💻 cs.IT math.IT
keywords analogcodesbeengeometricproposedcodecomputingcorrection
0
0 comments X
read the original abstract

Analog error correction codes have been proposed for analog in-memory computing on resistive crossbars, which can accelerate vector-matrix multiplication for machine learning. Unlike traditional communication or storage channels, this setting involves a mixed noise model with small perturbations and outlier errors. A number of analog codes have been proposed for handling a single outlier, and several constructions have also been developed to address multiple outliers. However, the set of available code families remains limited, covering only a narrow range of code lengths and dimensions. In this paper, we study a recently proposed family of geometric codes capable of handling multiple outliers, and develop a geometric analysis that characterizes their m-height profiles.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Tight Lower Bounds on The Single-Error Detection Threshold for Analog Error-Correcting Codes

    cs.IT 2026-05 unverdicted novelty 8.0

    Every (n-2)-dimensional subspace of R^n (n even) contains a nonzero vector with largest-to-second-largest absolute entry ratio at least n/2 - 1, and the general lower bound on single-error detection height is tight wh...