Timeline for Enumerator Polynomials for Linear Anytime Codes
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 17, 2015 at 19:53 | vote | accept | Nikola Kovachki | ||
| Jul 17, 2015 at 19:53 | comment | added | Nikola Kovachki | Thanks! I actually should have seen this earlier, but since $H$ is full rank and $C$ is the null space of $H$, it's immediate that $|C|=2^n$. Nevertheless, your approach is really nice because if you Taylor expand $A(x,y)$ around $x=0$ then you get $A(x,y) = 1+x(y^2+1)+x^2(2y^3+y^2+1)+...$ and that exactly determines the coefficients $a(n,k)$, so, if I can get a closed form of that expansion, I'll have an exact answer. Do you mind elaborating a bit on how you obtained your recurrence relations as it is not obvious to me. | |
| Jul 16, 2015 at 5:24 | history | answered | Gjergji Zaimi | CC BY-SA 3.0 |