Codes from symmetric polynomials
From MaRDI portal
Publication:2692950
DOI10.1007/s10623-022-01123-2OpenAlexW4304142904WikidataQ114849603 ScholiaQ114849603MaRDI QIDQ2692950
Publication date: 17 March 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.01930
Symmetric functions and generalizations (05E05) Linear codes (general theory) (94B05) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Weight enumeration of codes from finite spaces
- The minimum weight of the Grassmann codes C(k,n)
- Generalized Hamming weights of affine Cartesian codes
- Linear codes associated to skew-symmetric determinantal varieties
- Generalized Hamming weights for linear codes
- The weight hierarchy of higher dimensional Hermitian codes
- Generalized Hamming weights of q-ary Reed-Muller codes
- Generalized Reed-Muller codes
- A proof of Sørensen’s conjecture on Hermitian surfaces
This page was built for publication: Codes from symmetric polynomials