On<i>m</i>-MDS codes over finite fields (Q2921896): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207160.2013.818669 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058092035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On near-MDS codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic function fields and codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: NNMDS codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric approach to higher weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Hamming weights for linear codes / rank
 
Normal rank

Latest revision as of 04:31, 9 July 2024

scientific article
Language Label Description Also known as
English
On<i>m</i>-MDS codes over finite fields
scientific article

    Statements

    On<i>m</i>-MDS codes over finite fields (English)
    0 references
    0 references
    0 references
    14 October 2014
    0 references
    MDS code
    0 references
    \(m\)-MDS code
    0 references
    parity-check matrix
    0 references
    generator matrix
    0 references
    Hamming code
    0 references
    the minimum distance
    0 references
    Singleton defect
    0 references

    Identifiers