On the Height Profile of Analog Error-Correcting Codes
Ron M. Roth, Ziyuan Zhu, Changcheng Yuan, Paul H. Siegel, Anxiao Jiang

TL;DR
This paper studies the height profile of analog error-correcting codes, providing new characterizations and computational methods to understand their error detection and correction capabilities beyond traditional minimum distance metrics.
Contribution
It introduces a novel characterization of the height profile, formulates it as a linear programming problem, and offers geometric interpretations for certain code families.
Findings
Characterizations of the height profile are developed.
Methods for computing the height profile via linear programs are presented.
Explicit calculations of the height profile for various code families are demonstrated.
Abstract
In recent work, it has been shown that maintaining reliability in analog vector--matrix multipliers can be modeled as the following coding problem. Vectors in are encoded into codewords of a linear code over . For prescribed positive reals , additive errors of magnitude at most are tolerable and need no handling, yet outlying errors of magnitude greater than are to be located or detected. The trade-off between the ratio and the number of outlying errors that can be handled is determined by the height profile of ; as such, the height profile provides a finer description of the error handling capability of , compared to the minimum distance , which only determines the number of correctable errors. This work contains a further study of the notion of the height profile. Several…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStability and Control of Uncertain Systems · Interconnection Networks and Systems · Advanced Optimization Algorithms Research
