Abstract
Harwit and Sloane (1979) point out some connections between Hadamard matrices and error correcting codes. In particular they address the code constructed from H n created by augmenting H n with its inverse, ie, — H n and subsequently changing the ones to zeros and the minus ones to ones. The set of 2n+1 2n-bit words forms a code which has minimum distance 2n-1. They remark that this forms a first order Reed-Muller code.3
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Yarlagadda, R.K.R., Hershey, J.E. (1997). The Hadamard Transform and Error-Correction Coding. In: Hadamard Matrix Analysis and Synthesis. The Springer International Series in Engineering and Computer Science, vol 383. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6313-6_13
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6313-6_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7898-3
Online ISBN: 978-1-4615-6313-6
eBook Packages: Springer Book Archive