Trellis complexity and pseudoredundancy of relative two-weight codes
From MaRDI portal
Recommendations
Cites work
- Codes, cryptology and curves with computer algebra
- Constructions of intersecting codes
- Coset codes. II. Binary lattices and related codes
- Intersecting codes and independent families
- Intersecting codes and separating codes
- Maximum-likelihood soft decision decoding of BCH codes
- Minimal vectors in linear codes
- More on (2,2)-separating systems
- Notes on the value function
- On a kind of two-weight code
- On relative constant-weight codes
- On the Pseudocodeword Redundancy of Binary Linear Codes
- On the trellis complexity of certain binary linear block codes
- Secret sharing schemes from three classes of linear codes
- The weight hierarchies of q-ary codes of dimension 4
- Using Linear Programming to Decode Binary Linear Codes
Cited in
(8)- Value functions and two classes of binary codes
- Trellis complexity versus the coding gain of lattices. II
- The \(t\)-wise intersection and trellis of relative four-weight codes
- On relative constant-weight codes
- Minimal codewords: an application of relative four-weight codes
- A multivariate weight enumerator for tail-biting trellis pseudocodewords
- On the relative profiles of a linear code and a subcode
- The separation of binary relative three-weight codes and its applications
This page was built for publication: Trellis complexity and pseudoredundancy of relative two-weight codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q260089)
