Abstract
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each symbol occurs the same number of times in each codeword. The problem is to find a set of codewords such that any pair of codewords are a given uniform Hamming distance apart. The equidistant case is of special interest given the result that any optimal constant composition code is equidistant. This paper presents, compares and combines a number of different constraint formulations of this problem class, including a new method of representing permutations with constraints. Using these constraint models, we are able to establish several new results, which are contributing directly to mathematical research in this area.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Huczynska, S., Mullen, G.: Frequency permutation arrays. J. Combin. Des. 14, 463–478 (2006)
Chu, W., Colbourn, C., Dukes, P.: Constructions for permutation codes in powerline communications. Designs, Codes and Cryptography 32, 51–64 (2004)
Chu, W., Colbourn, C., Dukes, P.: On constant composition codes. Discrete Applied Math. 154, 912–929 (2006)
Huczynska, S.: Equidistant frequency permutation arrays and related constant composition codes. Designs, Codes and Cryptography (to appear, 2009)
Ding, C., Yin, J.: A construction of optimal constant composition codes. Designs, Codes and Cryptography 40, 157–165 (2006)
Slaney, J., Fujita, M., Stickel, M.: Automated reasoning and exhaustive search: Quasigroup existence problems. Computers and Mathematics with Applications 29, 115–132 (1995)
Gent, I.P., Jefferson, C., Miguel, I.: Minion: A fast, scalable, constraint solver. In: Proceedings 17th European Conference on Artificial Intelligence (ECAI 2006), pp. 98–102 (2006)
Gent, I.P., Jefferson, C., Miguel, I.: Watched literals for constraint propagation in minion. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 182–197. Springer, Heidelberg (2006)
Gent, I.P., Miguel, I., Rendl, A.: Tailoring solver-independent constraint models: A case study with Essence′ and Minion. In: Miguel, I., Ruml, W. (eds.) SARA 2007. LNCS (LNAI), vol. 4612, pp. 184–199. Springer, Heidelberg (2007)
Régin, J.C.: Generalized arc consistency for global cardinality constraint. In: Proceedings 13th National Conference on Artificial Intelligence (AAAI 1996), pp. 209–215 (1996)
Frisch, A.M., Jefferson, C., Miguel, I.: Symmetry breaking as a prelude to implied constraints: A constraint modelling pattern. In: Proceedings ECAI 2004, pp. 171–175 (2004)
Hnich, B., Smith, B.M., Walsh, T.: Dual modelling of permutation and injection problems. JAIR 21, 357–391 (2004)
Velev, M., Gao, P.: Efficient SAT techniques for absolute encoding of permutation problems: Application to hamiltonian cycles. In: Proceedings SARA 2009 (to appear, 2009)
Rendl, A., Miguel, I., Gent, I.P., Jefferson, C.: Automatically enhancing constraint model instances during tailoring. In: Proceedings of the Eighth International Symposium on Abstraction, Reformulation and Approximation, SARA 2009 (to appear, 2009)
Jefferson, C.: Representations in Constraint Programming. PhD thesis, Computer Science Department, York University, UK (2007)
Flener, P., Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking row and column symmetries in matrix models. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 462–476. Springer, Heidelberg (2002)
Choi, C.W., Harvey, W., Lee, J.H.M., Stuckey, P.J.: Finite domain bounds consistency revisited. In: Sattar, A., Kang, B.-h. (eds.) AI 2006. LNCS (LNAI), vol. 4304, pp. 49–58. Springer, Heidelberg (2006)
Walsh, T.: Breaking value symmetry. In: Proceedings of AAAI 2008 (2008)
Debruyne, R., Bessière, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: Proceedings 15th International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 412–417 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huczynska, S., McKay, P., Miguel, I., Nightingale, P. (2009). Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-04244-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04243-0
Online ISBN: 978-3-642-04244-7
eBook Packages: Computer ScienceComputer Science (R0)