Nets and their codes (Q1309826): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q265610 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Giorgio Faina / rank | |||
Normal rank |
Revision as of 07:44, 12 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nets and their codes |
scientific article |
Statements
Nets and their codes (English)
0 references
26 May 1994
0 references
From author's abstract: ``In this paper finite nets [cfr. \textit{R. H. Bruck}, Pac. J. Math. 13, 421-457 (1963; Zbl 0124.009)] will be studied using the following linear codes: the row space of the incidence vectors of lines, the intersection of this code with its orthogonal, the code generated by differences of parallel lines, and the orthogonal to these codes. Using these codes we are able to recast the \textit{G. E. Moorhouse} conjecture [cfr. Des. Codes Cryptography 1, No. 1, 7-29 (1991; Zbl 0755.05020)] in terms of subcodes of the codes he uses, determine coding- theoretic reasons for a net's being maximal, and generalize a theorem of Assmus and Key which uses codes to classify finite planes of prime order.'' In the references read [7] instead of [12] and [8] instead of [13].
0 references
finite nets
0 references
linear codes
0 references