Affine geometry designs, polarities, and Hamada's conjecture
暂无分享,去创建一个
[1] Vladimir D. Tonchev,et al. The twisted Grassmann graph is the block graph of a design , 2009, 0906.4509.
[2] J. Hirschfeld. Projective Geometries Over Finite Fields , 1980 .
[3] Vladimir D. Tonchev,et al. Quasi-symmetric 2-(31, 7, 7) designs and a revision of Hamada's conjecture , 1986, J. Comb. Theory, Ser. A.
[4] C. Colbourn,et al. Handbook of Combinatorial Designs , 2006 .
[5] Jack H. Koolen,et al. A New Family of Distance-Regular Graphs with Unbounded Diameter , 2005 .
[6] Luther D. Rudolph,et al. A class of majority logic decodable codes (Corresp.) , 1967, IEEE Trans. Inf. Theory.
[7] N. Hamada,et al. On the $p$-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes , 1973 .
[8] Jennifer D. Key,et al. Designs and their codes , 1992, Cambridge tracts in mathematics.
[9] Shu Lin,et al. On the construction of a class of majority-logic decodable codes , 1971, IEEE Trans. Inf. Theory.
[10] Hanfried Lenz,et al. Design theory , 1985 .
[11] Reinhard Diestel,et al. Graph Theory , 1997 .
[12] Ian F. Blake,et al. Majority logic decoding using combinatorial designs (Corresp.) , 1975, IEEE Trans. Inf. Theory.
[13] Vladimir D. Tonchev,et al. Polarities, quasi-symmetric designs, and Hamada’s conjecture , 2009, Des. Codes Cryptogr..