Cumulative-Separable Codes
Abstract
q-ary cumulative-separable (L,G(j))-codes L=\ α ∈ GF(qm):G(α )≠ 0 \ and G(j)(x)=G(x)j, 1 ≤ i≤ q are considered. The relation between different codes from this class is demonstrated. Improved boundaries of the minimum distance and dimension are obtained.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.