Abstract
In this paper we study the special class of equidistant constant composition codes of type CCC(n, d, μ m) (where n = m μ), which correspond to equidistant frequency permutation arrays; we also consider related codes with composition “close to” μ m. We establish various properties of these objects and give constructions for optimal families of codes.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Abrham J., Kotzig A.: Skolem sequences and additive permutations. Discrete Math. 37, 143–146 (1981)
Baranyai Z.: On the factorization of the complete uniform hypergraph. In: Infinite and Finite Sets, Proc. Conf. Keszthely, 1973, Colloquium of the Mathematical Society Janos Bolyai, vol. 10, pp. 91–108, North-Holland, Amsterdam (1975).
Chu W., Colbourn C.J., Dukes P.: Constructions for permutation codes in powerline communications. Des. Codes Cryptogr. 32, 51–64 (2004)
Chu W., Colbourn C.J., Dukes P.: On constant composition codes. Discrete Appl. Math. 154, 912–929 (2006)
Colbourn, C.J., Dinitz, J.H. (eds): The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton, FL (1996)
Ding C., Yin J.: Combinatorial constructions of constant composition codes. IEEE Trans. Inform. Theory 51, 3671–3674 (2005)
Ding C., Yin J.: A construction of optimal constant composition codes. Des. Codes Cryptogr. 40, 157–165 (2006)
Golomb S.: Shift Register Sequences. Holden-Day, San Francisco (1967)
Heinrich K., Van Rees G.H.J., Wallis W.D.: A general construction for equidistant permutation arrays. In: Graph Theory and Related Topics Proc. Conf., University of Waterloo, Waterloo, Ontario, 1977, pp. 247–252. Academic Press, New York-London (1979).
Huczynska S., Mullen G.L.: Frequency permutation arrays. J. Combin. Des. 14, 463–478 (2006)
Luo Y., Fu F-W., Han Vinck A.J., Chen W.: On constant-composition codes over \({\mathbb{Z}_q}\) . IEEE Trans. Inform. Theory 49, 3010–3016 (2003)
Nguyen Q.A., Gyorfi L., Massey J.L.: Constructions of binary constant-weight cyclic codes and cyclically permutable codes. IEEE Trans. Inform. Theory 38, 940–949 (1992)
Semakov N.V., Zinoviev V.A.: Equidistant q-ary codes with maximal distance and resolvable balanced incomplete block designs. Probl. Inform. Trans. 4, 1–7 (1968)
Vanstone S.A.: The asymptotic behaviour of equidistant permutation arrays. Can. J. Math. 21, 45–48 (1979)
Zeng F.: Construction of constant weight code and some upper bounds. In: ISIT 2005 Proceedings, Information Theory (2005).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Charles J. Colbourn.
Rights and permissions
About this article
Cite this article
Huczynska, S. Equidistant frequency permutation arrays and related constant composition codes. Des. Codes Cryptogr. 54, 109–120 (2010). https://doi.org/10.1007/s10623-009-9312-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-009-9312-0