A Bound for the Maximum Weight of a Linear Code

DOI10.1137/120880100zbMath1279.51001OpenAlexW2107255442MaRDI QIDQ5300513

Simeon Ball, Aart Blokhuis

Publication date: 27 June 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/24092

zbMATH Keywords

linear codesmaximum weight\(t\)-fold blocking sets\((n,r)\)-arcs

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Blocking sets, ovals, (k)-arcs (51E21) Combinatorial codes (94B25)

Related Items (9)

Generalized weights and the Ball-Blokhuis congruence ⋮ A generalization of Kung's theorem ⋮ Coding and bounds for partially defective memory cells ⋮ New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ A general construction for blocking sets in finite affine geometries ⋮ Binary Linear Codes with Near-Extremal Maximum Distance ⋮ A \(p\)-adic condition on the weight of a codeword of a linear code ⋮ On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces ⋮ Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes

This page was built for publication: A Bound for the Maximum Weight of a Linear Code