843 search results - page 3 / 169 » Codes and Projective Multisets |
DCC
1999
IEEE
13 years 5 months ago
1999
IEEE
We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
DCC
2008
IEEE
13 years 5 months ago
2008
IEEE
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...
ICSM
2003
IEEE
13 years 11 months ago
2003
IEEE
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...
DCC
2002
IEEE
14 years 5 months ago
2002
IEEE
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...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
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 ...