First Page | Document Content | |
---|---|---|
Date: 2012-01-02 21:22:35Coding theory NP-complete problems Finite fields Graph coloring Error detection and correction Linear code Clique problem Cyclic code Reed–Muller code Theoretical computer science Mathematics Graph theory | Add to Reading ListSource URL: neilsloane.comDownload Document from Source WebsiteFile Size: 62,46 KBShare Document on Facebook |
How to Calculate P(O) Calculating P(O) Forward Algorithm Backward AlgorithmDocID: 1rsaS - View Document | |
Daniels_meeting_cover.epsDocID: 1rphC - View Document | |
1 Underdesigned and Opportunistic Computing in Presence of Hardware Variability Puneet Gupta1 , Member, IEEE, Yuvraj Agarwal2 , Member, IEEE, Lara Dolecek1 , Member, IEEE, Nikil Dutt6 , Fellow, IEEE, Rajesh K. Gupta2 ,DocID: 1roDZ - View Document | |
PROBABILISTIC ALGORITHM FOR LIST VITERBI DECODING by Janani KalyanamDocID: 1rlYO - View Document |