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

An analogue to the Erdös-Ko-Rado theorem on q-ary Hamming code

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

We prove an anologue to the Erdos-Ko-Rado Theorem on q-ary Hamming code. Let C be a subset of [수식] and all codewords of C have weight k. Let the Hamming distance d(a, b) be in {1,2,...,2Κ} for every a, b in C. If n ≥ 2k - 1, then [수식]

Abstract

We prove an anologue to the Erdos-Ko-Rado Theorem on q-ary Hamming code. Let C be a subset of [수식] and all codewords of C have weight k. Let the Hamming distance d(a, b) be in {1,2,...,2Κ} for every a, b in C. If n ≥ 2k - 1, then [수식]

참고문헌 (16)

  1. N. Alon, "Multilinear polynomials and Frankl-Ray- Chaudhuri-Wilson type intersection theorems", J. Comb. Theory Ser.A, 58, pp.165~180 (1991)
  2. L. Babai, "A new proof for several inequalities on codes and sets", J. combin. Theory. Ser. A, 71, pp.146~153 (1995)
  3. W. Cao, "Improved Bounds on Families Under k-wise Set-Intersection Constraints", Graphs and Combinatorics, 23, pp.381~386 (2007)
  4. D. Daykin, "Erd}os-Ko-Rado from Kruskal-Katona", J. Combin. Theory. Ser. A, 17, pp.254~255 (1974)
  5. P. Delsarte, "An algebraic approach to the association schemes of coding theory", Philips Res. Rep.Suppl, 10 (1973)
  6. P. Delsarte, "The association schemes of coding theory, in combinatorics", Proceed- ings of the Nato Advanced Study Institute, pp.139~175 (1974)
  7. P. Frankl, "Orthogonal vectors in the n-dimensional cube and codes with missing distances", Combinatorica, 6, pp.279~285 (1986)
  8. Z. Furedi, "A proof and generalizations of the Erdos- Ko-Rado theorem using the method of linearly independent polynomials", Topics in Discrete Mathematics, 26, pp.215~224 (2006)
  9. V. Grolmusz, "On k-wise Set-Intersections and k-wise Hamming- Distances", J. Comb. Theory. Ser. A, 68, pp.180~190 (2002)
  10. K-W. Hwang, "Intersection families and Snevily's conjecture", Euro- pean Journal of Combinatorics, 28, pp.843~847 (2007)
  11. D. K. Ray-Chaudhuri, "On t-designs", Osaka. J. Math, 12, pp.737~744 (1975)
  12. H. S. Snevily, "On generalizations of the deBruijn-Erd}os Theorem", J. Combin. The- ory Ser. A, 68, pp.232~238 (1994)
  13. H. S. Snevily, "A generalization of the Ray Chaudhuri-Wilson Theorem", J. Combin. Designs, 3, pp.349~352 (1995)
  14. Jin Qian, "On mod-p Alon-Babai-Suzuki inequality", J. Algebraic Combin., 12, pp.85~93 (2000)
  15. Jin Qian, "Extremal case of Frankl-Ray-Chaudhuri-Wilson inequality, Special issue on design combinatorics: in honor of S. S. Shrikhande", J. Statist. Plann. Inference, 95, pp.293~306 (2001)
  16. H. S. Snevily, "A sharp bound for the number of sets that pairwise intersect at k positive values", Combinatorica, 23, pp.521~533 (2003)

관련 논문AI추천

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