Small Strong Blocking Sets by Concatenation

DOI10.1137/21M145032XMaRDI QIDQ5883273zbMATH OpenOpenAlexFDO

Authors Daniele Bartoli, Martino Borello

Publication date 30 March 2023

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

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

zbMATH Keywords

code concatenationminimal codessaturating setsstrong blocking sets

Mathematics Subject Classification ID

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

Recommendations

• Blocking sets in projective spaces
• On small blocking sets and their linearity
• On cutting blocking sets and their codes
• On (k,n)-blocking sets which can be obtained as a union of conics
• Multiple blocking sets in \(\text{PG}(n,q)\), \(n \geq 3\)

Cites work

• A geometric characterization of minimal codes and their asymptotic performance
• Constructing saturating sets in projective spaces using subgeometries
• Decoding linear block codes for minimizing word error rate (Corresp.)
• Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
• scientific article; zbMATH DE number 48941 (Why is no real title available?)
• scientific article; zbMATH DE number 607286 (Why is no real title available?)
• scientific article; zbMATH DE number 3803619 (Why is no real title available?)
• Intersecting codes and independent families
• Linear cutting blocking sets and minimal codes in the rank metric
• Linear nonbinary covering codes and saturating sets in projective spaces
• Lines in higgledy-piggledy arrangement
• Minimal linear codes arising from blocking sets
• Minimal multiple blocking sets
• Minimal vectors in linear codes
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
• On Baer subspaces of finite projective spaces
• On cutting blocking sets and their codes
• On minimal and quasi-minimal linear codes
• On the asymptotic behaviour of some towers of function fields over finite fields
• Resolving sets for higher dimensional projective spaces
• Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
• Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\)
• Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
• The Geometry of Two-Weight Codes
• Three combinatorial perspectives on minimal codes
• Towards secure two-party computation from the wire-tap channel
• Two classes of optimal p-ary few-weight codes from down-sets
• Variations on minimal linear codes

Cited in

(10)

• scientific article; zbMATH DE number 1795248 (Why is no real title available?)
• On the lower bound for the length of minimal codes
• Minimal codewords in norm-trace codes
• Saturating systems and the rank-metric covering radius
• Outer strong blocking sets
• Strong blocking sets and minimal codes from expander graphs
• Minimal linear codes from vectorial functions
• A note on strong blocking sets and higgledy-piggledy sets of lines
• The geometry of intersecting codes and applications to additive combinatorics and factorization theory
• Expander graphs, strong blocking sets and minimal codes (extended abstract)

This page was built for publication: Small Strong Blocking Sets by Concatenation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883273)