Trellis complexity and pseudoredundancy of relative two-weight codes
From MaRDI portal
Publication:260089
DOI10.1007/s00200-015-0276-1zbMath1357.94101OpenAlexW2199145167MaRDI QIDQ260089
Publication date: 18 March 2016
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-015-0276-1
Related Items (2)
The \(t\)-wise intersection and trellis of relative four-weight codes ⋮ The separation of binary relative three-weight codes and its applications
Cites Work
- On a kind of two-weight code
- Notes on the value function
- Intersecting codes and separating codes
- On relative constant-weight codes
- Using Linear Programming to Decode Binary Linear Codes
- Secret sharing schemes from three classes of linear codes
- Coset codes. II. Binary lattices and related 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
- Constructions of intersecting codes
- On the trellis complexity of certain binary linear block codes
- Intersecting codes and independent families
- On the Pseudocodeword Redundancy of Binary Linear Codes
- Codes, Cryptology and Curves with Computer Algebra
This page was built for publication: Trellis complexity and pseudoredundancy of relative two-weight codes
