Skip to main content
SpringerLink
Log in

Equidistant frequency permutation arrays and related constant composition codes

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abrham J., Kotzig A.: Skolem sequences and additive permutations. Discrete Math. 37, 143–146 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  2. 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).

  3. Chu W., Colbourn C.J., Dukes P.: Constructions for permutation codes in powerline communications. Des. Codes Cryptogr. 32, 51–64 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chu W., Colbourn C.J., Dukes P.: On constant composition codes. Discrete Appl. Math. 154, 912–929 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  5. Colbourn, C.J., Dinitz, J.H. (eds): The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton, FL (1996)

    MATH  Google Scholar 

  6. Ding C., Yin J.: Combinatorial constructions of constant composition codes. IEEE Trans. Inform. Theory 51, 3671–3674 (2005)

    Article  MathSciNet  Google Scholar 

  7. Ding C., Yin J.: A construction of optimal constant composition codes. Des. Codes Cryptogr. 40, 157–165 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Golomb S.: Shift Register Sequences. Holden-Day, San Francisco (1967)

    MATH  Google Scholar 

  9. 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).

  10. Huczynska S., Mullen G.L.: Frequency permutation arrays. J. Combin. Des. 14, 463–478 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. 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)

    Article  MathSciNet  Google Scholar 

  12. 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)

    Article  MATH  MathSciNet  Google Scholar 

  13. 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)

    Google Scholar 

  14. Vanstone S.A.: The asymptotic behaviour of equidistant permutation arrays. Can. J. Math. 21, 45–48 (1979)

    MathSciNet  Google Scholar 

  15. Zeng F.: Construction of constant weight code and some upper bounds. In: ISIT 2005 Proceedings, Information Theory (2005).

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, University of St Andrews, Fife, KY16 9SS, Scotland, UK

    Sophie Huczynska

Authors
  1. Sophie Huczynska
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sophie Huczynska.

Additional information

Communicated by Charles J. Colbourn.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-009-9312-0

Keywords

Mathematics Subject Classification (2000)

Search

Navigation