Constructions for permutation codes in powerline communications

Designs, Codes, and Cryptography

Volumn 32, Issue 1-3, 2004, Pages 51-64

  Chu, Wensong ^a   Colbourn, Charles J ^a   Dukes, Peter ^b  

^a Arizona State University   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Constant composition code; Heuristic search; Permutation array; Permutation code; Permutation polynomial; Reactive local search

Indexed keywords

CODES (SYMBOLS); FREQUENCIES; HEURISTIC METHODS; INFORMATION ANALYSIS; POLYNOMIALS; SET THEORY;

CONSTANT COMPOSITION CODES; HEURISTIC SEARCH; PERMUTATION ARRAYS; PERMUTATION CODES; POWERLINE COMMUNICATIONS;

CRYPTOGRAPHY;

EID: 3543117778     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:DESI.0000029212.52214.71     Document Type: Conference Paper

References (14)

1. R. Battiti and M. Protasi, Reactive local search for the maximum clique problem, Algorithmica, Vol. 29 (2001) pp. 610-637.
2. A. Bonisoli and P. Quattrocchi, Each invertible sharply d-transitive finite permutation set with d ≥ 4 is a group, J. Algebraic Combin., Vol. 12 (2000) pp. 241-250.
3. A. E. Brouwer, James B. Shearer, N. J. A. Sloane and Warren D. Smith, A new table of constant weight codes, IEEE Trans. Inform. Theory, Vol. 36 (1990) pp. 1334-1380.
4. C. J. Colbourn, T. Kløve and A. C. H. Ling, Permutation arrays for powerline communication and mutually orthogonal Latin squares, IEEE Trans. Information Theory (to appear).
5. P. Das, The number of permutation polynomials of a given degree over a finite field, Finite Fields and Their Applications, Vol. 8 (2002) pp. 478-490.
6. D. R. de la Torre, C. J. Colbourn and A. C. H. Ling, An application of permutation arrays to block ciphers. Proceedings of the Thirty-first Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 2000). Congr. Numer., Vol. 145 (2000) pp. 5-7.
7. M. Deza and S. A. Vanstone, Bounds for permutation arrays, J. Statist. Plann. Inference, Vol. 2 (1978) pp. 197-209.
8. H. C. Ferrtira and A. J. H. Vinck, Interference cancellation with permutation trellis codes, Proc. IEEE Vehicular Technology Conference, Vol. 5 (2000) pp. 2401-2407.
9. P. Frankl and M. Deza, On the maximum number of permutations with given maximal or minimal distance, J. Combin. Theory Ser. A, Vol. 22 (1977) pp. 352-360.
10. R. Lidl and H. Niederreiter, Finite Fields, second edition, Cambridge University Press (1997).
11. N. Pavlidou, A. J. H. Vinck, J. Yazdani and B. Honary, Power line communications: State of the art and future trends, IEEE Communications Magazine, (2003) pp. 34-40.
12. F. Rusfcey, C. R. Miers and J. Sawada, The number of irreducible polynomials and Lyndon words with given trace, SIAM J. Discrete Math., Vol. 14 (2001) pp. 240-245.
13. M. Svanström, P. R. J. Östergard and G. T. Rumelova, Bounds and constructions for ternary constant-composition codes, IEEE Trans. Inform. Theory, Vol. 48 (2002) pp. 101-111.
14. H. Tarnanen, Upper bounds on permutation codes via linear programming, European J. Combin., Vol. 20 (1999) pp. 101-114.