Yet another variation on minimal linear codes
Gérard Cohen, Sihem Mesnager, Hugues Randriambololona · Advances in Mathematics of Communications · 2016
Minimal linear codes are linear codes such that the support of every codeword does not contain the support of another linearly independent codeword. Such codes have applications in cryptography, e.g. to secret sharing. We pursue here their study and constructimproved asymptotically good families of minimal linear codes. We also consider quasi-minimal, $t$-minimal, and $t$-quasi-minimal linear codes, which are new variations on this notion.