A geometric approach to classifying Griesmer codes (Q2384039): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10623-007-9086-1 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-007-9086-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018282671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal arcs in Desarguesian planes of odd order do not exist / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(q^2+q+2, q+2\)-arcs in the projective plane \(PG(2,q)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of some optimal ternary linear codes of small length / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound for Error-Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min\(\cdot hyper\) in a finite projective geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4240564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension theorem for linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The packing problem in statistics, coding theory and finite projective spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5683869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal four-dimensional codes over \(\text{GF}(8)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraically punctured cyclic codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3418342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divisibility of codes meeting the Griesmer bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonexistence of a \([207,4,165]\) code over \(GF(5)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4538683 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10623-007-9086-1 / rank
 
Normal rank

Latest revision as of 07:57, 18 December 2024

scientific article
Language Label Description Also known as
English
A geometric approach to classifying Griesmer codes
scientific article

    Statements

    A geometric approach to classifying Griesmer codes (English)
    0 references
    0 references
    0 references
    20 September 2007
    0 references
    The subject matter of this paper concerns the classification of linear codes \([n,k,d]_q\) such that \(n\) equals the Griesmer bound \(g_q(k,d)\). The cases \(k=1,2\) were already studied by R. Hill (Cirencester, 1989). The cases \(k=3,4,5\) and small length was treated in [\textit{M. van Eupen, P. Lisonĕk}, Des. Codes Cryptography 10, No.~1, 63--84 (1997; Zbl 0869.94031)]. The authors investigate the case \(k=3\) and \(q\) a divisor of \(d\). Since such a code can be identify with an \((n,n-d)\)-arc in \(PG(2,q)\) the approach of the subject is treated via structures of Finite Geometry, namely maximal arcs and minihypers.
    0 references
    Griesmer bound
    0 references
    optimal code
    0 references
    multiset
    0 references
    arc
    0 references
    oval
    0 references
    minihyper
    0 references
    blocking set
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references