메뉴 건너뛰기




Volumn 364, Issue 1849, 2006, Pages 3199-3214

Powerline communication and the 36 officers problem

Author keywords

Coding theory; Permutation arrays; Powerline communication

Indexed keywords


EID: 33845662351     PISSN: 1364503X     EISSN: None     Source Type: Journal    
DOI: 10.1098/rsta.2006.1885     Document Type: Article
Times cited : (33)

References (15)
  • 2
    • 0018532881 scopus 로고
    • Coding with permutations
    • (doi:10.1016/S0019-9958(79)90076-7)
    • Blake, I. F., Cohen, G. & Deza, M. 1979 Coding with permutations. Inf. Control 43, 1-19. (doi:10.1016/S0019-9958(79)90076-7)
    • (1979) Inf. Control , vol.43 , pp. 1-19
    • Blake, I.F.1    Cohen, G.2    Deza, M.3
  • 3
    • 3543117778 scopus 로고    scopus 로고
    • Constructions for permutation codes in powerline communications
    • (doi:10.1023/B:DESI.0000029212.52214.71)
    • Chu, W., Colbourn, C. J. & Dukes, P. 2004 Constructions for permutation codes in powerline communications. Des. Codes Cryptogr. 32, 51-64. (doi:10.1023/B:DESI.0000029212.52214.71)
    • (2004) Des. Codes Cryptogr. , vol.32 , pp. 51-64
    • Chu, W.1    Colbourn, C.J.2    Dukes, P.3
  • 4
    • 33644785945 scopus 로고    scopus 로고
    • On constant composition codes
    • (doi:10.1016/j.dam.2005.09.009)
    • Chu, W., Colbourn, C. J. & Dukes, P. 2006 On constant composition codes. Discrete Appl. Math. 154, 912-929. (doi:10.1016/j.dam.2005.09.009)
    • (2006) Discrete Appl. Math. , vol.154 , pp. 912-929
    • Chu, W.1    Colbourn, C.J.2    Dukes, P.3
  • 5
    • 2942677106 scopus 로고    scopus 로고
    • Permutation arrays for powerline communication and mutually orthogonal latin squares
    • (doi:10.1109/TIT.2004.828150)
    • Colbourn, C. J., Kløve, T. & Ling, A. C. H. 2004 Permutation arrays for powerline communication and mutually orthogonal latin squares. IEEE Trans. Inf. Theory 50, 1289-1291. (doi:10.1109/TIT.2004.828150)
    • (2004) IEEE Trans. Inf. Theory , vol.50 , pp. 1289-1291
    • Colbourn, C.J.1    Kløve, T.2    Ling, A.C.H.3
  • 6
    • 0001319616 scopus 로고
    • On maximal numbers of permutations with given maximal or minimal distance
    • (doi:10.1016/0097-3165(77)90009-7)
    • Deza, M. & Frankl, P. 1977 On maximal numbers of permutations with given maximal or minimal distance. J. Comb. Theory A 22, 352-360. (doi:10.1016/0097-3165(77)90009-7)
    • (1977) J. Comb. Theory A , vol.22 , pp. 352-360
    • Deza, M.1    Frankl, P.2
  • 7
    • 26844580942 scopus 로고    scopus 로고
    • Combinatorial constructions of constant composition codes
    • (doi:10.1109/TIT.2005.855612)
    • Ding, C. & Yin, J. 2005 Combinatorial constructions of constant composition codes. IEEE Trans. Inf. Theory 51, 3671-3674. (doi:10.1109/TIT.2005. 855612)
    • (2005) IEEE Trans. Inf. Theory , vol.51 , pp. 3671-3674
    • Ding, C.1    Yin, J.2
  • 8
  • 9
    • 0003943159 scopus 로고    scopus 로고
    • Coded modulation for powerline communications
    • Han Vinck, A. J. 2000 Coded modulation for powerline communications. AEÜ J, 45-49.
    • (2000) AEÜ J , pp. 45-49
    • Han Vinck, A.J.1
  • 10
    • 33750503204 scopus 로고    scopus 로고
    • Frequency permutation arrays
    • (doi:10.1002/jcd.20096)
    • Huczynska, S. & Mullen, G. L. 2006 Frequency permutation arrays. J. Comb. Designs 14, 463-478. (doi:10.1002/jcd.20096)
    • (2006) J. Comb. Designs , vol.14 , pp. 463-478
    • Huczynska, S.1    Mullen, G.L.2
  • 12
    • 0038300082 scopus 로고    scopus 로고
    • Power lines communications: State of the art and future trends
    • (April) (doi:10.1109/MCOM.2003.1193972)
    • Pavlidou, N., Han Vinck, A. J., Yazdani, J. & Honary, B. 2003 (April) Power lines communications: state of the art and future trends. IEEE Commun. Mag. 41, 34-40. (doi:10.1109/MCOM.2003.1193972)
    • (2003) IEEE Commun. Mag. , vol.41 , pp. 34-40
    • Pavlidou, N.1    Han Vinck, A.J.2    Yazdani, J.3    Honary, B.4
  • 13
    • 84972529926 scopus 로고
    • A combinatorial problem in the symmetric group
    • Rothaus, O. & Thompson, J. G. 1966 A combinatorial problem in the symmetric group. Pac. J. Math. 18, 175-178.
    • (1966) Pac. J. Math. , vol.18 , pp. 175-178
    • Rothaus, O.1    Thompson, J.G.2
  • 15
    • 0033482899 scopus 로고    scopus 로고
    • Upper bounds on permutation codes via linear programming
    • (doi:10.1006/eujc.1998.0272)
    • Tarnanen, H. 1999 Upper bounds on permutation codes via linear programming. Eur. J. Comb. 20, 101-114. (doi:10.1006/eujc.1998.0272)
    • (1999) Eur. J. Comb. , vol.20 , pp. 101-114
    • Tarnanen, H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.