English

MacWilliams-type equivalence relations

Combinatorics 2013-01-03 v2

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 EE^* of an equivalence relation EE, the EE-weight (resp. EE^*-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.

Cite

@article{arxiv.1205.1090,
  title  = {MacWilliams-type equivalence relations},
  author = {Soohak Choi and Jong Yoon Hyun and Hyun Kwang Kim and Dong Yeol Oh},
  journal= {arXiv preprint arXiv:1205.1090},
  year   = {2013}
}
R2 v1 2026-06-21T20:58:57.958Z