Griesmer Bound
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Explicit Factorization of $x^{p+1}-1$ over $\mathbb{Z}_{p^e}$: A Structural Approach via Dickson Polynomials
arXiv:2604.19038v2 Announce Type: replace Abstract: Let $p$ be an odd prime. The factorization of the polynomial $x^{p+1}-1$ over the integer residue ring $\mathbb{Z}_{p^e}$ is pivotal for constructing cyclic codes with Hermitian symmetry, a critical resource for Linear Complementary Dual (LCD) codes and Entanglement-Assisted Quantum Error-Correcting Codes (EAQECC). Traditionally, lifting factorizations relies on the generic Hensel's Lemma, masking the underlying algebraic structure.
Weight distributions of two classes of linear codes with few weights derived from Weil sums
arXiv:2510.25578v2 Announce Type: replace Abstract: Linear codes with few weights have been a subject of study for many years, as they have applications in secret sharing, authentication codes, association schemes, and strongly regular graphs. In this article, two distinct classes of $p$-ary linear codes are constructed through the selection of two specific defining sets. Their weight distributions are completely determined for each case by detailed calculations on certain Weil sums.