Pages that link to "Item:Q5300513"
From MaRDI portal
The following pages link to A Bound for the Maximum Weight of a Linear Code (Q5300513):
Displaying 16 items.
- Generalized weights and the Ball-Blokhuis congruence (Q285237) (← links)
- A generalization of Kung's theorem (Q306069) (← links)
- On linear codes which attain the Solomon-Stiffler bound (Q798293) (← links)
- On linear codes whose weights and length have a common divisor (Q876321) (← links)
- Maximum weight spectrum codes (Q1726015) (← links)
- How many weights can a linear code have? (Q1755995) (← links)
- Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes (Q2075299) (← links)
- A general construction for blocking sets in finite affine geometries (Q2210799) (← links)
- A \(p\)-adic condition on the weight of a codeword of a linear code (Q2249654) (← links)
- On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces (Q2249785) (← links)
- (Q3511802) (← links)
- A note on full weight spectrum codes (Q5135734) (← links)
- Binary Linear Codes with Near-Extremal Maximum Distance (Q5138975) (← links)
- Coding and bounds for partially defective memory cells (Q6070355) (← links)
- New upper bounds and constructions of multi-erasure locally recoverable codes (Q6107451) (← links)
- Maximum weight codewords of a linear rank-metric code (Q6622741) (← links)