본문 바로가기
KERD
논문KCI 등재

Nonbinary incidence codes of (n,n-1,j)-poset

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

Let P be a (n,n-1,j)-poset, which is a partially ordered set of cardinality n with n-1 maximal elements and j(1 ≤ j ≤ n-1) minimal elements, and P* the dual poset of P. In this paper, we obtain two types of incidence codes of nonempty proper subset S of P and P*, respectively, by using Bogart's method [1] (see Theorem 3.3).

Abstract

Let P be a (n,n-1,j)-poset, which is a partially ordered set of cardinality n with n-1 maximal elements and j(1 ≤ j ≤ n-1) minimal elements, and P* the dual poset of P. In this paper, we obtain two types of incidence codes of nonempty proper subset S of P and P*, respectively, by using Bogart's method [1] (see Theorem 3.3).

참고문헌 (3)

  1. K. P. Bogart, "Incidence codes of posets: Eulerian posets and Reed-Muller codes", Discrete Math, 31, pp.1~7 (1980)
  2. R. A. Brualdi, "Codes with a poset metric", Discrete Math, 147, pp.57~72 (1995)
  3. Y. Jang, "On a MacWilliams type identity and a perfectness for a binary linear (n; n ¡ 1; j)-poset code", Discrete Math, 265, pp.85~104 (2003)

관련 논문AI추천

이 간행물의 다른 논문 (9건)