A Connection Between Coding Theory and Polarized Partition Relations

In this paper we establish a connection between polarized partition relations and the functionAq (n, d) of coding theory, which implies some known results and new examples of polarized relations. A connection between Aq(n, d) and the Zarankiewicz numbers is also discussed.

[1]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[2]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[3]  R. Guy.  A many-facetted problem of zarankiewicz , 1969 .

[4]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[5]  Jerrold R. Griggs,et al.  (0, 1)-Matrices with No Half-Half Submatrix of Ones , 1997, Eur. J. Comb..

[6]  Richard C. Singleton,et al.  Maximum distance q -nary codes , 1964, IEEE Trans. Inf. Theory.

[7]  Hanfried Lenz,et al.  Design theory , 1985 .

[8]  Robert W. Irving.  A bipartite Ramsey problem and the Zarankiewicz numbers , 1978, Glasgow Mathematical Journal.

[9]  M. Wodzicki.  Lecture Notes in Math , 1984 .

[10]  V. Sós,et al.  On a problem of K. Zarankiewicz , 1954 .

[11]  V. Chvatal,et al.  On Finite Polarized Partition Relations , 1969, Canadian Mathematical Bulletin.

[12]  Emile H. L. Aarts,et al.  Genetic Algorithms in Coding Theory - A Table for A3(n, d) , 1993, Discret. Appl. Math..

[13]  Geoffrey Exoo.  A bipartite Ramsey number , 1991, Graphs Comb..

[14]  Walter Alexandre Carnielli,et al.  K2, 2-K1, n and K2, n-K2, n bipartite Ramsey numbers , 2000, Discret. Math..

[15]  Frank Harary,et al.  Graph Theory , 2016 .

[16]  Jacobus H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[17]  Walter Carnielli,et al.  On the Ramsey Problem for Multicolor Bipartite Graphs , 1999 .

[18]  Zoltán Füredi,et al.  New Asymptotics for Bipartite Turán Numbers , 1996, J. Comb. Theory, Ser. A.

[19]  P. Erdös,et al.  A Partition Calculus in Set Theory , 1956 .

[20]  F. Sterboul,et al.  New results on finite polarized partition relations , 1983, J. Comb. Theory, Ser. B.