Abstract
We give an explicit decoding scheme for the permutation arrays under Hamming distance metric, where the encoding is constructed via a distance-preserving mapping from ternary vectors to permutations (3-DPM).
Similar content being viewed by others
References
Chang J.C., Chen R.J., Kløve T., Tsai S.C.: Distance-preserving mappings from binary vectors to permutations. IEEE Trans. Inform. Theory 49(4), 1054–1059 (2003)
Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)
Kløve T., Lin T.-T., Tsai S.-C., Tzeng W.-G.: Permutation arrays under the Chebyshev distance. IEEE Trans. Inform. Theory 56(6), 2611–2617 (2010)
Knuth D.E.: The Art of Computer Programming, Volume 3: Sorting and Searching, 2nd edn. Addison Wesley Longman, Reading, MA (1998)
Lin T.-T., Tsai S.-C., Tzeng W.-G.: Efficient encoding and decoding with permutation arrays. In: Proceedings 2008 IEEE International Symposium on Information Theory, Toronto, ON, Canada, July, 2008, pp. 211–214.
Lin T.-T., Tsai S.-C., Wu H.-L.: Simple distance-preserving mapping from ternary vectors to permutations. IEEE Trans. Inform. Theory 54(7), 3251–3256 (2008)
Vinck A.J.H.: Coded modulation for powerline communications. Proc. Int. J. Electron. Commun. 54(1), 45–49 (2000)
Vinck A.J.H., Häring J.: Coding and modulation for power-line communications. In: Proceedings of Interbational Symposium on Power Line Communication, Limerick, Ireland, April, 2000.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by P.Wild.
Rights and permissions
About this article
Cite this article
Lee, CJ., Lin, TT., Shieh, MZ. et al. Decoding permutation arrays with ternary vectors. Des. Codes Cryptogr. 61, 1–9 (2011). https://doi.org/10.1007/s10623-010-9435-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-010-9435-3