Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
From MaRDI portal
Publication:4975913
DOI10.1109/TIT.2009.2021379zbMath1367.94149WikidataQ56551249 ScholiaQ56551249MaRDI QIDQ4975913
Publication date: 8 August 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Decoding (94B35) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)
Related Items
Optimal group testing, Achieving the Holevo bound via a bisection decoding protocol, Soft Distance Metric Decoding of Polar Codes, Basics of Secrecy Coding, General Strong Polarization, Polar quantum channel coding with optical multi-qubit entangling gates for capacity-achieving channels, Characterizing the performance of wireless communication architectures via basic Diophantine approximation bounds, On Reed-Muller codes over \(\mathbb F_2+u\mathbb F_2\) and some applications, Exponents of polar codes using algebraic geometric code kernels, Efficient quantum key distribution protocol based on classical-quantum polarized channels, Error-Correcting Codes Against Chosen-Codeword Attacks, Blind reconciliation based on inverse encoding of polar codes with adaptive step sizes for quantum key distribution, Series of formulas for Bhattacharyya parameters in the theory of polar codes, Design and decoding of polar codes with large kernels: a survey, Probabilistic Amplitude Shaping, Rate-adaptive reconciliation with polar coding for continuous-variable quantum key distribution, Improved information reconciliation with systematic polar codes for continuous variable quantum key distribution, Theory behind quantum error correcting codes: an overview, Channel polarization of two-dimensional-input quantum symmetric channels, Neural decoders with permutation invariant structure, Polar coding for ring-LWE-based public key encryption, Shannon-limit approached information reconciliation for quantum key distribution, Polarization-adjusted convolutional (PAC) codes as a concatenation of inner cyclic and outer polar- and Reed-Muller-like codes, Achievable complexity-performance tradeoffs in lossy compression, Non-committing encryption with constant ciphertext expansion from standard assumptions, Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling, The exponent of a polarizing matrix constructed from the Kronecker product, Quantum Resistant Public Key Encryption Scheme polarRLCE, Parallel access by butterfly networks for any degree permutation polynomial and ARP interleavers, Some lengths for which CPP interleavers have weaker minimum distances than QPP interleavers, Recursive descriptions of polar codes, Interactive function computation via polar coding, On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length, Polar codes for distributed hierarchical source coding, Unnamed Item, Polar codes with higher-order memory, On Basing Private Information Retrieval on NP-Hardness, An improved analysis of least squares superposition codes with Bernoulli dictionary, Reed-Muller Codes, Successive cancellation decoding of Reed-Solomon codes
