scientific article; zbMATH DE number 1057740
From MaRDI portal
Publication:4352786
zbMath0874.94035MaRDI QIDQ4352786
No author found.
Publication date: 13 November 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
Minimal linear codes constructed from functions ⋮ The parameters of minimal linear codes ⋮ The maximum number of minimal codewords in an \([n,k\)-code] ⋮ Secret sharing schemes from binary linear codes ⋮ Optimal codes from Fibonacci polynomials and secret sharing schemes ⋮ Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\) ⋮ Minimal supports in linear codes ⋮ The optimal linear secret sharing scheme for any given access structure ⋮ Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents ⋮ Complete weight enumerators of a family of three-weight linear codes ⋮ Linear codes from quadratic forms ⋮ Minimal linear codes over finite fields ⋮ Hamming weight distributions of multi-twisted codes over finite fields ⋮ A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme ⋮ Yet another variation on minimal linear codes
This page was built for publication:
