Codes Satisfying the Chain Condition with a Poset Weights
Luciano Panek, Marcelo Firer
TL;DR
This paper extends generalized Wei weights to poset-weight codes and proves that all linear codes with support on a totally ordered subposet satisfy the chain condition.
Contribution
It introduces an extension of Wei weights to poset codes and establishes a condition under which all such codes satisfy the chain condition.
Findings
All linear codes with support on a totally ordered subposet satisfy the chain condition.
Extension of Wei weights to poset-weight codes.
Supports of codes influence chain condition satisfaction.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Finite Group Theory Research