On the Capacity of Constrained Permutation Codes for Rank Modulation

DOI10.1109/TIT.2016.2519400MaRDI QIDQ2976886zbMATH OpenFDO

Authors Sarit Buzaglo, Eitan Yaakobi

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2016.2519400

Mathematics Subject Classification ID

Modulation and demodulation in information and communication theory (94A14) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• Codes in Permutations and Error Correction for Rank Modulation
• Constructions of Rank Modulation Codes
• On the performance of permutation codes for multi-user communication
• Random coding bound and codes produced by permutations for the multiple-access channel
• Coding for the $\boldsymbol \ell _\infty $ -Limited Permutation Channel
• Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels
• scientific article; zbMATH DE number 3458466
• Convolutional Codes in Rank Metric With Application to Random Network Coding
• A new rank metric for convolutional codes
• Rank-metric codes and their applications

Cited in

(1)

• Coding for locality in reconstructing permutations

This page was built for publication: On the Capacity of Constrained Permutation Codes for Rank Modulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976886)