Formal weight enumerators and Chebyshev polynomials
From MaRDI portal
Publication:2081555
DOI10.1007/s00200-020-00469-1OpenAlexW3101549041MaRDI QIDQ2081555
Publication date: 13 October 2022
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-020-00469-1
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Special polynomials in general fields (12E10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On some families of certain divisible polynomials and their zeta functions
- Extremal invariant polynomials not satisfying the Riemann hypothesis
- Divisible formal weight enumerators and extremal polynomials not satisfying the Riemann hypothesis
- On the notion of Jacobi polynomials for codes
- Resultants of Chebyshev Polynomials: the First, Second, Third, and Fourth Kinds
This page was built for publication: Formal weight enumerators and Chebyshev polynomials