REVIEW 1 cited by
On extendibility of additive code isometries
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
On extendibility of additive code isometries
read the original abstract
For linear codes, the MacWilliams Extension Theorem states that each linear isometry of a linear code extends to a linear isometry of the whole space. But, in general, it is not the situation for nonlinear codes. In this paper it is proved, that if the length of an additive code is less than some threshold value, then an analogue of the MacWilliams Extension Theorem holds. One family of unextendible code isometries for the threshold value of code length is described.
Forward citations
Cited by 1 Pith paper
-
Minimal Counterexamples of the MacWilliams Extension Theorem for Stabilizer Codes
The MacWilliams extension theorem fails for stabilizer codes at every qudit dimension; for qubits the minimal counterexample lives at length 3 and is essentially unique, with minimal full-support counterexamples at le...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.