<--- Back to Details
First PageDocument Content
Coding theory / Discrete mathematics / Mathematics / Information theory / Decoding methods / Information / Error exponent / Limit of a function / ReedSolomon error correction / Burst error-correcting code
Date: 2016-01-25 17:31:48
Coding 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 Codes

Add to Reading List

Source URL: isl.stanford.edu

Download Document from Source Website

File Size: 640,14 KB

Share Document on Facebook

Similar Documents

ISIT 2003, Yokohama, Japan, June 29 – July 4, 2003  Sparse Data Blocks and Multi-User Channels Edward A. Ratzer Cavendish Laboratory, University of Cambridge Madingley Road, Cambridge CB3 0HE, UK

ISIT 2003, Yokohama, Japan, June 29 – July 4, 2003 Sparse Data Blocks and Multi-User Channels Edward A. Ratzer Cavendish Laboratory, University of Cambridge Madingley Road, Cambridge CB3 0HE, UK

DocID: 1r9m5 - View Document

6536  IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 61, NO. 12, DECEMBER 2015 Optimal Achievable Rates for Interference Networks With Random Codes

6536 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 61, NO. 12, DECEMBER 2015 Optimal Achievable Rates for Interference Networks With Random Codes

DocID: 1pWdo - View Document

1  IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. COM-34. NO. 1. JANUARY 1986 Multide-User Interference in FHMA-DPSK Qpread-Spectrum Communications

1 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. COM-34. NO. 1. JANUARY 1986 Multide-User Interference in FHMA-DPSK Qpread-Spectrum Communications

DocID: 1njBT - View Document