A Bound for the Maximum Weight of a Linear Code
From MaRDI portal
Publication:5300513
DOI10.1137/120880100zbMATH Open1279.51001OpenAlexW2107255442MaRDI QIDQ5300513FDOQ5300513
Authors: 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
Recommendations
- On the maximality of linear codes
- scientific article; zbMATH DE number 1284417
- The linear programming bound for binary linear codes
- Upper Bounds on the Weight Distribution Function for Some Classes of Linear Codes
- Delsarte's Linear Programming Bound for Constant-Weight Codes
- scientific article; zbMATH DE number 969276
- scientific article
- scientific article; zbMATH DE number 4123671
- scientific article; zbMATH DE number 3543912
- An upper bound for binary constant weight codes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05) Combinatorial codes (94B25)
Cited In (13)
- A general construction for blocking sets in finite affine geometries
- On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces
- How many weights can a linear code have?
- Binary Linear Codes with Near-Extremal Maximum Distance
- Generalized weights and the Ball-Blokhuis congruence
- New upper bounds and constructions of multi-erasure locally recoverable codes
- A generalization of Kung's theorem
- Coding and bounds for partially defective memory cells
- Maximum weight codewords of a linear rank-metric code
- A \(p\)-adic condition on the weight of a codeword of a linear code
- Title not available (Why is that?)
- Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes
- On linear codes which attain the Solomon-Stiffler bound
This page was built for publication: A Bound for the Maximum Weight of a Linear Code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300513)