Pith. sign in

REVIEW 1 cited by

Geometric approach to the MacWilliams Extension Theorem for codes over modules

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

arxiv 1507.05212 v1 pith:UWQ5WOZO submitted 2015-07-18 cs.IT math.COmath.IT

classification cs.ITmath.COmath.IT
keywords extensiontheoremalphabetcodeslinearmoduleapproachcode
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The MacWilliams Extension Theorem states that each linear Hamming isometry of a linear code extends to a monomial map. In this paper an analogue of the extension theorem for linear codes over a module alphabet is observed. A geometric approach to the extendability of isometries is described. For a matrix module alphabet we found the minimum length of a code for which an unextendable Hamming isometry exists. We also proved an extension theorem for MDS codes over a module alphabet.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Minimal Counterexamples of the MacWilliams Extension Theorem for Stabilizer Codes

    quant-ph 2026-07 conditional novelty 6.0 of 10

    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...

Pith tools