On the intersection of binary linear codes
From MaRDI portal
Publication:328230
DOI10.1007/s11424-015-4123-zzbMath1372.94457OpenAlexW2287051630MaRDI QIDQ328230
Publication date: 20 October 2016
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-015-4123-z
value functiontrellis complexityseparating propertytwo-weight codeminimal codewordminimal access structure
Related Items (1)
Cites Work
- Unnamed Item
- Secret sharing schemes from binary linear codes
- Intersecting codes and separating codes
- On relative constant-weight codes
- The weights of the orthogonals of the extended quadratic binary Goppa codes
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Coset codes. II. Binary lattices and related codes
- Generalized Hamming weights of linear codes
- Maximum-likelihood soft decision decoding of BCH codes
- The weight hierarchies of q-ary codes of dimension 4
- More on (2,2)-separating systems
- Minimal vectors in linear codes
- On the trellis complexity of certain binary linear block codes
- Intersecting codes and independent families
- Families of curves and weight distributions of codes
- The Weight Distribution of Some Irreducible Cyclic Codes
This page was built for publication: On the intersection of binary linear codes