On relative constant-weight codes
From MaRDI portal
Publication:2339140
DOI10.1007/s10623-013-9896-2zbMath1393.94933MaRDI QIDQ2339140
Publication date: 30 March 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9896-2
finite projective geometry; secret sharing; relative two-weight code; minimal codeword; relative three-weight code; wire-tap channel of type II
Related Items
New Results on the Pseudoredundancy, Trellis complexity and pseudoredundancy of relative two-weight codes, The geometric structure of relative one-weight codes, On the intersection of binary linear codes, Optimal non-projective linear codes constructed from down-sets, The \(t\)-wise intersection and trellis of relative four-weight codes, A family of linear codes from constant dimension subspace codes, Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions, The separation of binary relative three-weight codes and its applications
Cites Work
- Unnamed Item
- On a kind of two-weight code
- Secret sharing schemes from binary linear codes
- Notes on the value function
- Classification of Griesmer codes and dual transform
- Linear intersecting codes
- A class of three-weight cyclic codes
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Some New Characters on the Wire-Tap Channel of Type II
- Secret sharing schemes from three classes of linear codes
- The weight hierarchies of q-ary codes of dimension 4
- Minimal vectors in linear codes
- Constructions of intersecting codes
- Dimension/length profiles and trellis complexity of linear block codes
- Geometric approach to higher weights
- Codes, Cryptology and Curves with Computer Algebra
