First Page | Document Content | |
---|---|---|
![]() Date: 2015-04-09 11:13:04Discrete mathematics Mathematics Finite fields Computer arithmetic Post-quantum cryptography Hamming code McEliece cryptosystem Cyclic code Reed–Solomon error correction Coding theory Error detection and correction Information theory | Source URL: csrc.nist.govDownload Document from Source WebsiteFile Size: 423,12 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 |