Yet another variation on minimal linear codes

DOI10.3934/amc.2016.10.53zbMath1352.94089OpenAlexW2327527861MaRDI QIDQ259266

Sihem Mesnager, Hugues Randriambololona, Gérard D. Cohen

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

zbMATH Keywords

linear codesminimal codesquasi-minimal codes

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combinatorial codes (94B25) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (4)

Constructing few-weight linear codes and strongly regular graphs ⋮ Linear codes with few weights from weakly regular plateaued functions ⋮ Linear codes with few weights from weakly regular bent functions based on a generic construction ⋮ Binary linear codes with few weights from Boolean functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \((2,1)\)-separating systems beyond the probabilistic bound
• 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
• Minimal vectors in linear codes

This page was built for publication: Yet another variation on minimal linear codes