Dimension/length profiles and trellis complexity of linear block codes
From MaRDI portal
Recommendations
Cited in
(46)- On codes satisfying the double chain condition
- Error detection capability of shortened Hamming codes and their dual codes.
- Projective codes which satisfy the chain condition
- Relative generalized Hamming weights of cyclic codes
- Harder-Narasimhan theory for linear codes (with an appendix on Riemann-Roch theory)
- On some classes of codes with a few weights
- Goppa-like bounds for the generalized Feng-Rao distances.
- A lower bound on the weight hierarchies of product codes.
- Finite projective geometries and classification of the weight hierarchies of codes. I
- On linear projective codes which satisfy the chain condition.
- On trellis structures for Reed-Muller codes
- The \(t\)-wise intersection and trellis of relative four-weight codes
- Further results on higher weights of codes over finite rings
- Notes on generalized Hamming weights of some classes of binary codes
- Value functions and two classes of binary codes
- On the relative profiles of a linear code and a subcode
- The generalization of some trellis properties of linear codes to group codes
- Theory of supports for linear codes endowed with the sum-rank metric
- Relative profiles and extended weight polynomials of almost affine codes
- On relative constant-weight codes
- Generalized Hamming weights of three classes of linear codes
- The weight hierarchy of a family of cyclic codes with arbitrary number of nonzeroes
- Higher Hamming weights for locally recoverable codes on algebraic curves
- Blakley type secret sharing scheme based on the intersection of subspaces
- Code constructions and existence bounds for relative generalized Hamming weight
- Bounds on the trellis size of linear block codes
- Trellis complexity of linear block codes via atomic codewords
- Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes
- Generalizations of the Griesmer bound
- The weighted coordinates bound and trellis complexity of block codes and periodic packings
- A method of protected distribution of data among unreliable and untrusted nodes
- The “Art of Trellis Decoding” Is NP-Hard
- Weight hierarchies of linear codes of dimension 3
- Radon transforms and packings
- Subspace subcodes of generalized Reed-Solomon codes
- The weight hierarchies of q-ary linear codes of dimension 4
- The weight hierarchies of linear codes from simplicial complexes
- Considerate ramp secret sharing
- Some three-weight linear codes and their complete weight enumerators and weight hierarchies
- The weight distributions and weight hierarchies of two classes of few-weight linear codes
- On the support weight distributions of relative subcodes of some classes of codes
- Multilayer crisscross error and erasure correction
- Complete weight enumerators and weight hierarchies of two classes of linear codes
- The weight hierarchies of three classes of linear codes
- Generalized Hamming weights of additive codes and geometric counterparts
- Reducing measurements in quantum erasure correction by quantum local recovery
This page was built for publication: Dimension/length profiles and trellis complexity of linear block codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4850277)
