Relative generalized Hamming weights of affine Cartesian codes
From MaRDI portal
Publication:2182085
DOI10.1007/s10623-020-00745-8zbMath1448.94292arXiv1909.06138OpenAlexW3011836851MaRDI QIDQ2182085
Publication date: 21 May 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.06138
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorics of partially ordered sets (06A07) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (1)
Cites Work
- Unnamed Item
- On the next-to-minimal weight of affine Cartesian codes
- The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
- Decoding affine variety codes using Gröbner bases
- Vanishing ideals of projective spaces over finite fields and a projective footprint bound
- Generalized Hamming weights of affine Cartesian codes
- Weighted Reed-Muller codes revisited
- Generalized minimum distance functions
- Hilbert functions and the finite degree Zariski closure in finite field combinatorial geometry
- Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes
- Affine Cartesian codes
- On the second Hamming weight of some Reed-Muller type codes
- Some New Characters on the Wire-Tap Channel of Type II
- Generalized Hamming weights for linear codes
- Generalized Hamming weights of q-ary Reed-Muller codes
- Footprints or generalized Bezout's theorem
- Footprint and minimum distance functions
- Using Algebraic Geometry
- Ideals, Varieties, and Algorithms
- A generalization of a combinatorial theorem of macaulay
This page was built for publication: Relative generalized Hamming weights of affine Cartesian codes
