Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
On the rank of incidence matrices for points and lines of finite affine and projective geometries over a field of four elements
Kovalenko M., Urbanovich T. Problems of Information Transmission50 (1):79-89,2014.Type:Article
Date Reviewed: Feb 2 2015

An incidence geometry is, briefly described, a set of elements that have a different type and an incidence relation satisfying certain axioms. Typical examples include projective spaces, affine spaces, and polar spaces. The elements of type 1 are commonly called points, elements of type 2 are lines, and so on. When dealing with finite incidence geometries, that is, the number of points, lines, planes, and so on, is finite, it makes sense to consider the incidence matrix defined as follows. Consider elements of two different types, for example, points and lines, and label them. Define a matrix aij as follows: aij = 1 if and only if point i is incident with line j, and aij = 0 otherwise. The incidence matrix can be interpreted as a matrix over the field of order p, p prime. A natural question is what its rank over GF(p) is (this number is called the p-rank).

In this paper, the authors show the following results: (1) the 2-rank of the incidence matrix of points and lines of an h-dimensional projective space over GF(4) equals ; and (2) the 2-rank of the incidence matrix of points of lines of an h-dimensional affine space over GF(4) equals 4h-h2-h-1. The obtained results are related to results of Hamada on the p-rank of incidence matrices of points and higher dimensional subspaces of projective spaces.

Knowledge of (bounds on) the p-rank of an incidence matrix is particularly useful when such a matrix is used as a generator matrix or as a parity check matrix of a linear code over a field of order p. A lot of research has been done on the p-rank of incidence matrices of particular incidence structures, and the results obtained in this paper nicely contribute to this field of research.

Reviewer:  Jan De Beule Review #: CR143129 (1504-0298)
Bookmark and Share
  Featured Reviewer  
 
Error Control Codes (E.4 ... )
 
 
Code Breaking (E.3 ... )
 
 
Code Inspections And Walk-Throughs (D.2.5 ... )
 
 
Nonsecret Encoding Schemes (E.4 ... )
 
 
Reentrant Code (D.2.3 ... )
 
 
Standards (D.2.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Error Control Codes": Date
Error coding cookbook
Rorabaugh C., McGraw-Hill, Inc., Hightstown, NJ, 1996. Type: Book (9780079117205)
Apr 1 1997
Trellis decoding of block codes
Honary B., Markarian G., Kluwer Academic Publishers, Norwell, MA, 1997. Type: Book (9780792398608)
Mar 1 1998
An enumeration of binary self-dual codes of length 32
Bilous R., Van Rees G. Designs, Codes and Cryptography 26(1/2/3): 61-86, 2002. Type: Article
Mar 6 2003
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy