Papers
Topics
Authors
Recent
Search
2000 character limit reached

MacWilliams-type equivalence relations

Published 5 May 2012 in math.CO | (1205.1090v2)

Abstract: Let P\mathcal{P} be a poset on [n][n], I(P)\mathcal{I}(\mathcal{P}) the set of order ideals of P\mathcal{P} and EE an equivalence relation on I(P)\mathcal{I}(\mathcal{P}). The concepts of the dual relation E<sup>∗E<sup>* of an equivalence relation EE, the EE-weight (resp. E<sup>∗E<sup>*-weight) distribution of a linear poset code (resp. its dual poset code) and a MacWilliams-type equivalence relation are introduced. We give a characterization for a MacWilliams-type equivalence relation in terms of MacWilliams-type identities for a linear poset code. Three kinds of equivalence relations on I(P)\mathcal{I}(\mathcal{P}) which are of MacWilliams-type are found, i.e., (i)(i) we show that every equivalence relation defined by the automorphism of P\mathcal{P} is a MacWilliams-type; (ii)(ii) we provide a new characterization for poset structures when the equivalence relation defined by the same cardinality on I(P)\mathcal{I}(\mathcal{P}) becomes a MacWilliams-type; (iii)(iii) we also give necessary and sufficient conditions for poset structures in which the equivalence relation defined by the order-isomorphism on I(P)\mathcal{I}(\mathcal{P}) is a MacWilliams-type.

Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.