Construction of (sometimes) optimal linear codes
Michael Braun, Axel Kohnert, Alfred Wassermann · ERef Bayreuth (University of Bayreuth) · 2005
For the purpose of error correcting linear codes over a finite field GF (q) and fixed dimension k we are interested in codes with high minimum distance d as these allow the correction of up to ⌊(d − 1)/2 ⌋ errors. On the other hand we are interested in codes with minimum redundancy, i.e. codes of small length n. High