Further results on higher weights of codes over finite rings
From MaRDI portal
Publication:2113367
DOI10.1016/j.disc.2022.112811zbMath1484.94027OpenAlexW4206834113MaRDI QIDQ2113367
Publication date: 14 March 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.112811
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On MDR codes over a finite ring
- Code constructions and existence bounds for relative generalized Hamming weight
- Higher weights for codes over rings
- On the weight hierarchy of product codes
- On generalized Hamming weights for Galois ring linear codes
- On the structure of linear and cyclic codes over a finite chain ring
- Higher weights and near-MDR codes over chain rings
- The second generalized Hamming weight of some evaluation codes arising from a projective torus
- Relative generalized Hamming weights of cyclic codes
- Generalized Hamming weights of three classes of linear codes
- Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes
- The Weight Hierarchy of Some Reducible Cyclic Codes
- Generalized Hamming Weights of Irreducible Cyclic Codes
- On the Relative Generalized Hamming Weights of Linear Codes and their Subcodes
- Some New Characters on the Wire-Tap Channel of Type II
- Generalized Hamming weights for linear codes
- On the generalized Hamming weights of product codes
- On the Hamming distance of linear codes over a finite chain ring
- Improved Constructions of Nested Code Pairs
- On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings
- Dimension/length profiles and trellis complexity of linear block codes
- Density/length profiles and trellis complexity of lattices
- Algebraic Coding Theory Over Finite Commutative Rings
- Chains, Demi-Matroids, and Profiles
This page was built for publication: Further results on higher weights of codes over finite rings
