Talk:Hadamard code: Difference between revisions

Revision as of 19:21, 27 October 2017

Revision as of 15:48, 15 September 2019

Line 101:

::That's exactly why I'm trying to ask for a discussion here. I handled the situation the way I did, and I'm interested in whether other editors have better ideas. [[User:Ylloh|ylloh]] ([[User talk:Ylloh|talk]]) 15:29, 22 February 2013 (UTC)

First, I want to acknowledge Ylloh for significantly improving this page. Second, I want to note that I am professor in ECE and teach graduate classes on this subject. I was drawn to this page because a student in my class was incorrectly using the term "punctured Hadamard code" based on this Wikipedia page. The "punctured Hadamard code" is a [2^k - 1, k,2^{k-1} - 1] code formed by puncturing any single bit of the Hadamard code (all are equivalent). This family is dual to the family of [2^k - 1,2^k - k - 1,3] Hamming codes, up to equivalence. For example, this reference [http://pages.cs.wisc.edu/~dieter/Courses/2013s-CS880/Scribes/PDF/lecture03.pdf] makes this point without discussing equivalence). I don't know if there is a standard term (other than 1st-order Reed-Muller) for the code this page calls the "punctured Hadamard code". Using standard terminology, however, it should be called the "augmented Hadamard code" because augmenting refers to increasing the dimension by one whereas puncturing refers to reducing the length by 1. Thus, I am going fix this on the main page.

== External links modified ==