Maximum weight spectrum codes with reduced length
Abstract
A q-ary linear code of dimension k is called a maximum weight spectrum (MWS) code if it has the maximum possible number (viz. (qk-1)/(q-1)) of different non-zero weights. We construct MWS codes from quasi-minimal codes, thus obtaining of much shorter length than hitherto known. By an averaging argument, we show the existence of MWS codes of even shorter length.
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.