Cyclic constructions of distance-preserving maps

@article{Lee2005CyclicCO,
  title={Cyclic constructions of distance-preserving maps},
  author={Kwankyu Lee},
  journal={IEEE Transactions on Information Theory},
  year={2005},
  volume={51},
  pages={4392-4396}
}
Distance-preserving maps (DPMs) from binary vectors to permutations are useful for the construction of permutation arrays. A new construction of DPMs is presented. We study the distance increasing property of the new DPMs that this construction yields. Then we show that new DPMs contain a class of nicely structured DPMs of even length with good distance increasing property 
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

Distance-increasing mappings from binary vectors to constant composition vectors

2009 IEEE International Symposium on Information Theory • 2009
View 1 Excerpt

Convolutional Code Search for Good Permutation Trellis Codes using M-ary FSK

2007 IEEE International Symposium on Power Line Communications and Its Applications • 2007

Distance-increasing maps of all lengths by simple mapping algorithms

IEEE Transactions on Information Theory • 2006
View 5 Excerpts

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Distance - preserving mappings frombinary vectors to permutations New distance - preserving maps of odd length

T. Kløve, S.-C. Tsai
IEEE Trans . Inf . Theory • 2004
View 7 Excerpts
Highly Influenced

New distance-preserving maps of odd length

IEEE Transactions on Information Theory • 2004
View 7 Excerpts

Distance-preserving mappings frombinary vectors to permutations

J.-C. Chang, R.-J. Chen, T. Kløve, S.-C. Tsai
IEEETrans. Inf. Theory, vol. 49, no. 4, pp. 1054–1059, Apr. 2003. • 2003

Similar Papers

Loading similar papers…