Codes Satisfying the Chain Condition with a Poset Weights

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In this paper we extend the concept of generalized Wei weights for
poset-weight codes and show that all linear codes C satisfy the chain condition
if support of C is a subposet totally ordered.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Codes Satisfying the Chain Condition with a Poset Weights 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 Codes Satisfying the Chain Condition with a Poset Weights, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Codes Satisfying the Chain Condition with a Poset Weights will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-537416

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.