DocumentCode :
2270185
Title :
On the distance optimality of permutation mappings
Author :
Swart, Theo G. ; De Beer, Ian ; Ferreira, Hendrik C.
Author_Institution :
Dept. of Electr. & Electron. Eng. Sci., Johannesburg Univ.
fYear :
2005
fDate :
4-9 Sept. 2005
Firstpage :
1068
Lastpage :
1072
Abstract :
We investigate the optimal Hamming distance that is achievable when mapping binary sequences to permutation sequences. This is used to determine how close to optimum some of the known mappings are. Furthermore, using simulation results we show that mappings found by exhaustive search using optimum distance as criterion perform better than previous known mappings
Keywords :
Hamming codes; binary sequences; binary sequences; optimal Hamming distance; permutation mappings; permutation sequences; Africa; Binary sequences; Convolutional codes; Frequency shift keying; Hamming distance; Power line communications;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
Type :
conf
DOI :
10.1109/ISIT.2005.1523503
Filename :
1523503
Link To Document :
بازگشت