Comparar métodos

	Teorema de Capacidad del Canal de Shannon	Múltiple Entrada Múltiple Salida (MIMO)	Códigos Polares con Decodificación por Cancelación Sucesiva
Campo	Telecomunicaciones	Telecomunicaciones	Telecomunicaciones
Familia	Process / pipeline	Process / pipeline	Process / pipeline
Año de origen	1948	1995	2009
Autor original	Claude Shannon	Telatar, Foschini, and Gans	Erdal Arikan
Tipo	fundamental theoretical bound	spatial multiplexing technique	recursive error-correcting code
Fuente seminal	Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379-423.	Telatar, I. (1999). Capacity of multi-antenna Gaussian channels. European Transactions on Telecommunications, 10(6), 585-595.	Arikan, E. (2009). Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Transactions on Information Theory, 55(7), 3051-3073.
Alias	channel capacity, information theory bound	spatial multiplexing, antenna diversity	channel polarization, recursive codes
Relacionados	5	5	5
Resumen	Shannon's channel capacity theorem, published in 1948, establishes the maximum rate at which information can be reliably transmitted over a noisy channel. Expressed as C = B log2(1 + S/N) for additive white Gaussian noise (AWGN), it is a fundamental bound in information theory and communications engineering. Shannon proved that reliable communication is possible at any rate below capacity, and impossible above it. This theorem underpins the design of all modern communication systems and motivates coding theory, modulation, and signal processing techniques.	MIMO is a technique that uses multiple transmit and receive antennas to significantly increase channel capacity and reliability. Pioneered theoretically by Telatar (1999) and Foschini & Gans (1998), MIMO exploits multipath propagation—typically a liability in wireless—as an asset by creating independent spatial channels. It is now fundamental to all modern wireless systems including LTE, WiFi-6, and 5G, where it provides both capacity gains through spatial multiplexing and robustness through diversity.	Polar codes, introduced by Erdal Arikan in 2009, are the first constructive family of codes proven to achieve the Shannon capacity of symmetric binary-input memoryless channels. They use recursive construction and successive cancellation decoding, a simple greedy algorithm with theoretical guarantees. Polar codes were adopted in 5G NR for control channel coding and are studied for future 6G systems. Unlike turbo and LDPC codes (which are empirical), polar codes provide rigorous theoretical foundations.