Proofs of two conjectures on the dimensions of binary codes (Q2439731): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4004114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of the theory of blocks of characters of finite groups. IV / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die Zerlegungsmatrizen der Gruppen \(PSL(2,p^f)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: LDPC codes generated by conics in the classical projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hexagons, Conics, A<sub>5</sub> and PSL<sub>2</sub> (<i>K</i> ) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Error-Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5683869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The principal block of finite groups with dihedral Sylow 2-subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ovals In a Finite Projective Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimensions of some binary codes arising from a conic in \(\mathrm{PG}(2,q)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On binary codes from conics in \(\mathrm{PG}(2,q)\) / rank
 
Normal rank

Latest revision as of 12:09, 7 July 2024

scientific article
Language Label Description Also known as
English
Proofs of two conjectures on the dimensions of binary codes
scientific article

    Statements

    Proofs of two conjectures on the dimensions of binary codes (English)
    0 references
    0 references
    17 March 2014
    0 references
    A non-degenerate conic \(\mathbf O\) in \(\mathrm{PG}(2, q)\) is a set of \(q + 1\) points that satisfy a non-degenerate quadratic form. No three points of \(\mathbf O\) are collinear thus making \(\mathbf O\) an oval of \(\mathrm{PG}(2, q)\), and a well-known result of Segre asserts that ovals in \(\mathrm{PG}(2, q)\) with \(q\) odd arise precisely in this manner. Let \(B\) denote the binary matrix corresponding to the incidence between external points (those that lie on two tangent lines) versus passant lines of \(\mathbf O\) and \(B_0\) denote the binary matrix corresponding to the incidence between internal points (those that lie on no tangent line) versus the secant lines. Then \(B\) is a \(\frac{q(q+1)}{2} \times \frac{q(q-1)}{2}\) binary matrix while \(B_0\) is a \(\frac{q(q-1)}{2} \times \frac{q(q+1)}{2}\) binary matrix. Let \(\mathbf L\) and \(\mathbf L_0\) denote the binary linear codes generated by the column null space of \(B\) and \(B_0\) respectively. Confirming a conjecture of Droms et. al. the author proves that the rank of \(\mathbf L\) is \(\frac{q^2-1}{4} - q\) if \(q \equiv 1 \pmod4\) and is \(\frac{q^2-1}{4} - q + 1\) if \(q \equiv 3 \pmod4\) while the rank of \(\mathbf L_0\) is \(\frac{q^2-1}{4}\) if \(q \equiv 1 \pmod4\) and is \(\frac{q^2-1}{4} + 1\) if \(q \equiv 3 \pmod4\). The proof technique is both combinatorial and uses modular forms via Brauer's theory of characters.
    0 references
    0 references
    0 references
    0 references
    0 references
    block idempotent
    0 references
    Brauer's theory
    0 references
    character
    0 references
    conic
    0 references
    general linear group
    0 references
    incidence matrix
    0 references
    low-density parity-checkcode
    0 references
    module
    0 references
    2-rank
    0 references
    conic in \(\mathrm{PG}(2, q)\)
    0 references
    binary rank
    0 references
    0 references
    0 references
    0 references