Optimal permutation codes for the Gaussian channel
From MaRDI portal
Publication:4336327
DOI10.1109/18.567763zbMATH Open0871.94016OpenAlexW2132863268MaRDI QIDQ4336327FDOQ4336327
Authors: Yaw O. Chang, John K. Karlof
Publication date: 29 September 1997
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.567763
Recommendations
Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60) Permutation groups (20B99)
Cited In (13)
- Permutation codes for sources
- Optimal coding strategies for certain permuting channels
- Title not available (Why is that?)
- Sharp groups, two-weight codes and maximal arcs.
- Permutation codes for the Gaussian channel
- A tutorial on geometric programming
- Group codes for the Gaussian broadcast channel with two receivers
- Permutation codes for the Gaussian broadcast channel with two receivers
- Permutation codes with specified packing radius
- Representing group codes as permutation codes
- Quantization of high dimensional Gaussian vector using permutation modulation with application to information reconciliation in continuous variable QKD
- On optimal permutation codes
- Tractable approximate robust geometric programming
This page was built for publication: Optimal permutation codes for the Gaussian channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336327)