The weight hierarchies of \(q\)-ary linear codes of dimension 4
From MaRDI portal
Publication:607012
DOI10.1016/j.disc.2010.08.018zbMath1207.94075OpenAlexW2059816336MaRDI QIDQ607012
Publication date: 19 November 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.08.018
Related Items (1)
Cites Work
- On the weight hierarchy of product codes
- Weight hierarchies of linear codes satisfying the almost chain condition
- The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
- A lower bound on the greedy weights of product codes
- A lower bound on the weight hierarchies of product codes.
- Generalized Hamming weights for linear codes
- Generalized Hamming weights of linear codes
- On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
- Minimum support weights of binary codes
- Codes satisfying the chain condition
- On the generalized Hamming weights of product codes
- Maximum-likelihood soft decision decoding of BCH codes
- The weight hierarchies of q-ary codes of dimension 4
- Bounds on the weight hierarchies of linear codes of dimension 4
- Dimension/length profiles and trellis complexity of linear block codes
- The worst case probability of undetected error for linear codes on the local binomial channel
- Weight hierarchies of linear codes of dimension 3
- Weight hierarchies of binary linear codes of dimension 4
- Upper bounds on weight hierarchies of extremal non-chain codes
This page was built for publication: The weight hierarchies of \(q\)-ary linear codes of dimension 4