On optimal permutation codes
From MaRDI portal
Publication:4544737
DOI10.1109/18.959273zbMATH Open1017.94007OpenAlexW2158896659MaRDI QIDQ4544737FDOQ4544737
Authors: Vivek K. Goyal, S. A. Savari, Wei Wang
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/016c88b8c762a6f1033a8597a9c8ed03b77e849d
Recommendations
Cited In (13)
- New permutation codes using Hadamard unscrambling (Corresp.)
- Frame permutation quantization
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
- Permutation codes for sources
- Title not available (Why is that?)
- A comparison of known codes, random codes, and the best codes
- An enumerative method for runlength-limited codes: permutation codes
- Permutation codes for the Laplacian source (Corresp.)
- On some connections between permutations and coding
- Diagonally neighbour transitive codes and frequency permutation arrays
- Quantization of high dimensional Gaussian vector using permutation modulation with application to information reconciliation in continuous variable QKD
- Robust indexing of lattices and permutation codes over binary symmetric channels
- Effect of Random Permutation of Symbols in a Sequence
This page was built for publication: On optimal permutation codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544737)