2012•arXiv (Cornell University)Open access

Codes Satisfying the Chain Condition with a Poset Weights

Luciano Panek, Marcelo Firer

Open full text 0 citations

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Partially ordered set, Chain (unit), Mathematics, Combinatorics, Discrete mathematics, Physics, Astronomy

Related papers

Back to paper searchBrowse research topicsOriginal source
Codes Satisfying the Chain Condition with a Poset Weights — Research Paper | ScholarLens