Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces

DOI10.1109/TIT.2021.3123730zbMath1489.94141arXiv2103.07393OpenAlexW3210818709MaRDI QIDQ5030330

Zoltán Lóránt Nagy, Tamás Héger

Publication date: 17 February 2022

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

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

zbMATH Keywords

upper boundlower and upper boundssaturating sets in projective spacesGalois fieldbounds on the size of covering codesminimal length of minimal codessize of higgledy-piggledy line sets in projective spaces

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Related Items (6)

Small Strong Blocking Sets by Concatenation ⋮ Higgledy-piggledy sets in projective spaces of small dimension ⋮ On the lower bound for the length of minimal codes ⋮ Minimal codewords in norm-trace codes ⋮ Saturating systems and the rank-metric covering radius ⋮ Unnamed Item

This page was built for publication: Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces