Simple proofs for duality of generalized minimum poset weights and weight distributions of (Near-)MDS poset codes

Details Simple proofs for duality of generalized minimum poset weights and weight distributions of (Near-)MDS poset codes Simple proofs for duality of generalized minimum poset weights and weight distributions of (Near-)MDS poset codes

2011-04-06

arxiv.org/abs/1104.0988v1

Computer Science

Information Theory

No comments

Scientific paper

In 1991, Wei introduced generalized minimum Hamming weights for linear codes and showed their monotonicity and duality. Recently, several authors extended these results to the case of generalized minimum poset weights by using different methods. Here, we would like to prove the duality by using matroid theory. This gives yet another and very simple proof of it. In particular, our argument will make it clear that the duality follows from the well-known relation between the rank function and the corank function of a matroid. In addition, we derive the weight distributions of linear MDS and Near-MDS poset codes in the same spirit.

Affiliated with

Also associated with

No associations

Rating

Simple proofs for duality of generalized minimum poset weights and weight distributions of (Near-)MDS poset codes 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 Simple proofs for duality of generalized minimum poset weights and weight distributions of (Near-)MDS poset codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple proofs for duality of generalized minimum poset weights and weight distributions of (Near-)MDS poset codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-417088