Computer Science – Information Theory
Scientific paper
2012-03-06
Computer Science
Information Theory
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.
Firer Marcelo
Panek Luciano
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-537416