Timeline for Given g1(x), g2(x) minimize over p(x) Hamming weight of [p(x)g1; p(x)g2(x) ] ? (Or how to find minimal distance of convolutional code?)
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 24, 2012 at 7:22 | vote | accept | Alexander Chervov | ||
| Jul 19, 2012 at 19:14 | comment | added | Alexander Chervov | Forgot to write p(x) is NON zero. Otherwise we get zero Hamming weight immediately. | |
| Jul 19, 2012 at 14:36 | answer | added | Jyrki Lahtonen | timeline score: 1 | |
| Jul 19, 2012 at 12:30 | history | edited | Alexander Chervov | CC BY-SA 3.0 |
completely rewritten
|
| Jul 17, 2012 at 11:27 | history | edited | Alexander Chervov | CC BY-SA 3.0 |
added 185 characters in body; edited title
|
| Jul 17, 2012 at 10:59 | history | edited | Alexander Chervov | CC BY-SA 3.0 |
added 236 characters in body
|
| Jul 17, 2012 at 9:20 | history | asked | Alexander Chervov | CC BY-SA 3.0 |