pith. sign in

arxiv: 0902.2316 · v3 · submitted 2009-02-13 · 💻 cs.IT · math.IT

On weak isometries of Preparata codes

classification 💻 cs.IT math.IT
keywords codesisometriconlypreparataweaklydistancelengthanalogous
0
0 comments X
read the original abstract

Let C1 and C2 be codes with code distance d. Codes C1 and C2 are called weakly isometric, if there exists a mapping J:C1->C2, such that for any x,y from C1 the equality d(x,y)=d holds if and only if d(J(x),J(y))=d. Obviously two codes are weakly isometric if and only if the minimal distance graphs of these codes are isomorphic. In this paper we prove that Preparata codes of length n>=2^12 are weakly isometric if and only if these codes are equivalent. The analogous result is obtained for punctured Preparata codes of length not less than 2^10-1.

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.