Abstract:
We consider the Wilson malrix (classical or subspace), whose columns and rows are indexed, respectively, by k- and t-subsets of a given n-set (k- and t-dimensional subspaces of a given n-dimensional space over GF (q)), the matrix cell contains 1, if the k-set corresponding to the column includes the t-set corresponding to the row (resp. for subspaces), otherwise 0. A survey of the results on the dimension and code distance of codes for which the parity-check matrix is the Wilson matrix is given.
References
-
Bhaskar Bagchi, S. P. Inamdar, “Projective Geometric Codes”, Journal of Combinatorial Theory, Series A, 99:1 (2002), 128–142
    -
M. Lavrauw, L. Storme, G. Van de Voorde, “Linear codes from projective spaces”, Error-correcting codes, finite geometries and cryptography, Contemp. Math., 523, Amer. Math. Soc., 2010, 185–202
-
N. Kashyap, A. Vardy, “Stopping sets in codes from designs”, ISIT 2003, IEEE International Symposium on Information Theory - Proceedings, IEEE, 2003, 122
-
E. F. Assmus, J. D. Key, Designs and their codes, Cambridge Tracts in Mathematics, 103, Cambridge University Press, 1992
-
N. Hamada, “On the $p$-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes”, Hiroshima Math. J., 3:2 (1973), 153–226
|
