We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
We study codewords of small weight in the codes arising from Desarguesian projective planes. We first of all improve the results of K. Chouinard on codewords of small weight in th...
Veerle Fack, Szabolcs L. Fancsali, Leo Storme, Gee...
Function point analysis is a well known established method to estimate the size of software systems and software projects. However, because it is based on functional documentation...
We use methods of Mortimer [19] to examine the subcodes spanned by minimumweight vectors of the projective generalized Reed-Muller codes and their duals. These methods provide a p...
In this paper we introduce the class of Spread Codes for the use in random network coding. Spread Codes are based on the construction of spreads in finite projective geometry. The ...
Felice Manganiello, Elisa Gorla, Joachim Rosenthal