Content deleted Content added
No edit summary |
Will Orrick (talk | contribs) No edit summary |
||
Line 2:
:If there are 2<sup>''n''+1</sup> codewords, then ''k'' = ''n''+1. Therefore, it was correct as it was. [[User:Oli Filth|Oli Filth]]<sup>([[User talk:Oli Filth|talk]])</sup> 17:25, 9 March 2008 (UTC)
::I believe the anonymous user was pointing out that unless the Hadamard matrix of order 2<sup>n</sup> used to produce the codewords is equivalent to the matrix obtained from Sylvester's construction, the resulting code will not be linear. For example, there are millions of Hadamard matrices of order 32, any of which can be used to construct a (32,64,16) code, but only when Sylvester's matrix is used will it also be a [32,6,16] code.
::As far as I am aware, some authors use “Hadamard code” to refer to this more general construction, which doesn't even require that the Hadamard matrix have power-of-two order.[[User:Will Orrick|Will Orrick]] ([[User talk:Will Orrick|talk]]) 04:04, 15 March 2008 (UTC)
| |||