On the minimum distance graph of an extended Preparata code

Details On the minimum distance graph of an extended Preparata code On the minimum distance graph of an extended Preparata code

2009-02-09

arxiv.org/abs/0902.1351v1

Computer Science

Information Theory

Scientific paper

The minimum distance graph of an extended Preparata code P(m) has vertices
corresponding to codewords and edges corresponding to pairs of codewords that
are distance 6 apart. The clique structure of this graph is investigated and it
is established that the minimum distance graphs of two extended Preparata codes
are isomorphic if and only if the codes are equivalent.

Affiliated with

Also associated with

No associations

Rating

On the minimum distance graph of an extended Preparata code does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the minimum distance graph of an extended Preparata code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the minimum distance graph of an extended Preparata code will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-175866