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

On the separation of linear constant-weight codes

1

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

By using the finite projective geometry method, the separating properties of linear constant-weight codes are presented. An algorithm is given for computing the cardinality of separating coordinate positions of certain disjoint codeword sets of linear constant-weight codes.

Abstract

By using the finite projective geometry method, the separating properties of linear constant-weight codes are presented. An algorithm is given for computing the cardinality of separating coordinate positions of certain disjoint codeword sets of linear constant-weight codes.

참고문헌 (8)

  1. W. D. Chen, "The weight hierarchies of q-ary codes of dimension 4", IEEE Trans. Inform. Theory, 42(6), pp.2265~2272 (1996)
  2. G. Cohen, "Intersecting codes and separating codes", Discrete Appl. Math, 128(1), pp.75~83 (2003)
  3. G. Cohen, "More on (2, 2)-separating systems", IEEE Trans. Inform. Theory, 48(9), pp.2606~2609 (2002)
  4. G. Cohen, "Intersecting codes and independent families", IEEE Trans. Inform. Theory, 40, pp.1872~1881 (1994)
  5. S. Encheva, "Constructions of intersecting codes", IEEE Trans. Inform. Theory, 45(4), pp.1234~1237 (1999)
  6. Z. H. Liu, "Notes on the value function", Des. Codes Cryptogr, 54(1), pp.11~19 (2010)
  7. J. A. Wood, "The structure of linear codes of constant weight", Trans. Amer. Math. Soc, 354(3), pp.1007~1026 (2002)
  8. J. A. Wood, "Relative one-weight linear codes", Des. Codes Cryptogr, 72(2), pp.331~344 (2014)

관련 논문AI추천

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