Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, Netherlands
Abstract:
Upper bounds and constructions are given for super-visible codes. These are linear codes with the property that all words of minimum weight form a basis of the code. Optimal super-visible codes are summarized for small lengths and minimum distances.