First Page | Document Content | |
---|---|---|
Date: 2016-01-25 17:31:48Coding theory Discrete mathematics Mathematics Information theory Decoding methods Information Error exponent Limit of a function ReedSolomon error correction Burst error-correcting code | 6536 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 61, NO. 12, DECEMBER 2015 Optimal Achievable Rates for Interference Networks With Random CodesAdd to Reading ListSource URL: isl.stanford.eduDownload Document from Source WebsiteFile Size: 640,14 KBShare Document on Facebook |