New simple constructions of distance-increasing mappings from binary vectors to permutations
References (10)
- et al.
Constructions of permutation arrays
IEEE Trans. Inform. Theory
(2002) - H.C. Ferreira, A.J.H. Vinck, Inference cancellation with permutation trellis arrays, in: Proc. IEEE Vehicular...
- et al.
Two constructions of permutation arrays
IEEE Trans. Inform. Theory
(2004) - T. Kløve, Classification of permutation codes of length 6 and minimum distance 5, in: Proc. Internat. Symp. Information...
- A.J.H. Vinck, J. Häring, Coding and modulation for power-line communications, in: Proc. Internat. Symp. Power Line...
There are more references available in the full text version of this article.
Cited by (3)
Constructing constant composition codes via distance-increasing mappings
2012, SIAM Journal on Discrete MathematicsDistance-increasing mappings from binary vectors to constant composition vectors
2009, IEEE International Symposium on Information Theory - ProceedingsDistance-preserving and distance-increasing mappings from ternary vectors to permutations
2008, IEEE Transactions on Information Theory
Copyright © 2006 Elsevier B.V. All rights reserved.