A \(p\)-adic condition on the weight of a codeword of a linear code (Q2249654): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On intersection sets in Desarguesian affine spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3464677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound for the Maximum Weight of a Linear Code / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiple nuclei and a conjecture of Lunelli and Sce / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering all points except one / rank
 
Normal rank
Property / cites work
 
Property / cites work: The blocking number of an affine space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial multiplicities over finite fields and intersection sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of finite fields to combinatorics and finite geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering finite fields with cosets of subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum distance<tex>q</tex>-nary codes / rank
 
Normal rank

Latest revision as of 16:49, 8 July 2024

scientific article
Language Label Description Also known as
English
A \(p\)-adic condition on the weight of a codeword of a linear code
scientific article

    Statements

    Identifiers