Full Characterization of Minimal Linear Codes as Cutting Blocking Sets

DOI10.1109/TIT.2021.3070377zbMath1475.94198arXiv1911.09867OpenAlexW3141673911MaRDI QIDQ5001750

Qunying Liao, Yan Qiu, Zhengchun Zhou, Chun-Ming Tang

Publication date: 23 July 2021

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.09867

zbMATH Keywords

projective planesboundsconstructionminimal projective codes of dimension 3t-fold blocking sets

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Blocking sets, ovals, (k)-arcs (51E21)

Related Items

Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound ⋮ On cutting blocking sets and their codes ⋮ Small Strong Blocking Sets by Concatenation ⋮ Minimal linear codes from weakly regular bent functions ⋮ Minimal binary linear codes: a general framework based on bent concatenation ⋮ Three Combinatorial Perspectives on Minimal Codes ⋮ Minimal linear codes constructed from functions ⋮ Higgledy-piggledy sets in projective spaces of small dimension ⋮ Linear cutting blocking sets and minimal codes in the rank metric ⋮ Some hypersurfaces over finite fields, minimal codes and secret sharing schemes ⋮ Several classes of linear codes with few weights over finite fields ⋮ On the lower bound for the length of minimal codes ⋮ Optimal binary linear codes from posets of the disjoint union of two chains ⋮ On the minimum number of minimal codewords ⋮ Saturating systems and the rank-metric covering radius ⋮ Wide minimal binary linear codes from the general Maiorana-Mcfarland class ⋮ A geometric characterization of minimal codes and their asymptotic performance