On the lower bound for the length of minimal codes
From MaRDI portal
Publication:6080135
DOI10.1016/j.disc.2023.113676arXiv2302.05350OpenAlexW4386916970MaRDI QIDQ6080135
Publication date: 30 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.05350
Cites Work
- Linear nonbinary covering codes and saturating sets in projective spaces
- An application of coding theory to estimating Davenport constants
- Minimal 2-coverings of a finite affine space based on GF(2)
- Linear intersecting codes
- Covering finite fields with cosets of subspaces
- Minimal linear codes arising from blocking sets
- A geometric characterization of minimal codes and their asymptotic performance
- On cutting blocking sets and their codes
- On Minimal and Quasi-minimal Linear Codes
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Linear programming bounds for tree codes (Corresp.)
- Minimal vectors in linear codes
- Covering arrays and intersecting codes
- Intersecting codes and independent families
- Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
- Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
- Three Combinatorial Perspectives on Minimal Codes
- Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
- Minimal Linear Codes From Characteristic Functions
- Small Strong Blocking Sets by Concatenation
This page was built for publication: On the lower bound for the length of minimal codes
