Yet another variation on minimal linear codes
DOI10.3934/AMC.2016.10.53zbMATH Open1352.94089OpenAlexW2327527861MaRDI QIDQ259266FDOQ259266
Authors: Sihem Mesnager, Gérard Cohen, Hugues Randriam 
Publication date: 11 March 2016
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2016.10.53
Recommendations
Combinatorial codes (94B25) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cites Work
- Linear intersecting codes
- Algebraic-geometric codes and asymptotic problems
- Generalized hashing and parent-identifying codes.
- Intersecting codes and separating codes
- Towers of function fields over non-prime finite fields
- On products and powers of linear codes under componentwise multiplication
- On minimal and quasi-minimal linear codes
- Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans
- Oblivious transfers and intersecting codes
- Towards secure two-party computation from the wire-tap channel
- Upper Bounds on Separating Codes
- \((2,1)\)-separating systems beyond the probabilistic bound
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal vectors in linear codes
Cited In (17)
- Variations on minimal linear codes
- Strong blocking sets and minimal codes from expander graphs
- Minimal linear codes constructed from partial spreads
- A geometric characterization of minimal codes and their asymptotic performance
- Linear codes with few weights from weakly regular plateaued functions
- Minimal binary linear codes: a general framework based on bent concatenation
- Minimal linear codes arising from blocking sets
- Minimal linear codes over finite fields
- On minimal and quasi-minimal linear codes
- Constructing few-weight linear codes and strongly regular graphs
- Binary linear codes with few weights from Boolean functions
- A novel dynamic and verifiable secret sharing scheme based on linear codes
- An inductive construction of minimal codes
- Minimal linear codes from Hermitian varieties and quadrics
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
- On the weight distribution of some minimal codes
This page was built for publication: Yet another variation on minimal linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259266)
