the-essence-of-well-educated-intelligence-unveiled

unveiling-marketing-performance-with-shapley-value-regression

generative-ai-in-eu-law-legal-implications-and-challenges

learning-from-sparse-offline-datasets-via-conservative-density-estimation

enhancing-text-guided-image-editing-with-multi-round-thinking

tumtraf-event-calibration-and-fusion-for-roadside-event-based-and-rgb-cameras

scalable-and-robust-model-versioning-for-deep-learning-security

investigating-deep-spatial-context-in-attention-based-models-with-spatial-regression


The paper establishes improved upper bounds on the number of non-zero weights of simple-root constacyclic codes by calculating the number of orbits of a larger subgroup of the automorphism group of the code.


coremsg

improved-upper-bounds-on-the-number-of-non-zero-weights-of-constacyclic-codes


Improved Upper Bounds on the Number of Non-Zero Weights of Constacyclic Codes


title_rewrite

Upper Bounds on Non-Zero Weights of Constacyclic Codes