Skip to main content
SpringerLink
Log in

A Construction of Optimal Constant Composition Codes

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

Abstract

In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].

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. RJR Abel M Greig (1997) ArticleTitleSome new RBIBDs with block size 5 and PBDs with block sizes ≡ 1 mod 5 Austral J Combin 15 177–202 Occurrence Handle0881.05019 Occurrence Handle1448240

    MATH  MathSciNet  Google Scholar 

  2. T Beth D Jungnickel H Lenz (1999) Design theory Cambridge University Press Cambridge

    Google Scholar 

  3. GT Bogdanova AE Brouwer S Kapralov PRJ Östergård (2001) ArticleTitleError-correcting codes over an alphabet of four elements Designs, Codes Crypt 23 333–342 Occurrence Handle1011.94029 Occurrence Handle10.1023/A:1011275112159

    Article  MATH  Google Scholar 

  4. Chu W, Colbourn CJ, Dukes P On constant composition codes. Discrete Applied Math. (to appear)

  5. CJ Colbourn JH Dinitz (1996) The CRC handbook of combinatorial designs CRC Press Boca Raton, FL

    Google Scholar 

  6. CJ Colbourn T Kløve ACH Ling (2004) ArticleTitlePermutation arrays for powerline communication and mutually orthogonal Latin squares IEEE Trans Inform Theory 50 IssueID6 1289–1291 Occurrence Handle2094885 Occurrence Handle10.1109/TIT.2004.828150

    Article  MathSciNet  Google Scholar 

  7. M Deza SA Vanstone (1978) ArticleTitleBounds for permutation arrays J Stat Plan Inference 2 197–209 Occurrence Handle0384.05026 Occurrence Handle498191 Occurrence Handle10.1016/0378-3758(78)90008-3

    Article  MATH  MathSciNet  Google Scholar 

  8. C Ding J Yin (2005) ArticleTitleCombinatorial constructions of optimal constant composition codes IEEE Trans Inform Theory 51 IssueID10 3671–3674 Occurrence Handle10.1109/TIT.2005.855612

    Article  Google Scholar 

  9. S Furino Y Miao J Yin (1996) Frames and resolvable designs CRC Press Boca Raton

    Google Scholar 

  10. M Greig DH Rees (2003) ArticleTitleExistence of balanced incomplete block designs for many sets of treatments Discrete Math 261 299–324 Occurrence Handle1008.05017 Occurrence Handle1961753 Occurrence Handle10.1016/S0012-365X(02)00476-4

    Article  MATH  MathSciNet  Google Scholar 

  11. H Hanani DK Ray-Chaudhuri RM Wilson (1972) ArticleTitleOn resolvable designs Discrete Math 3 IssueID11 343–357 Occurrence Handle0263.05016 Occurrence Handle309752 Occurrence Handle10.1016/0012-365X(72)90091-X

    Article  MATH  MathSciNet  Google Scholar 

  12. Huczynska S, Mullen GL Frequency permutation arrays. J Combin Designs (to appear)

  13. Y Luo FW Fu AJ Han Vinck W Chen (2003) ArticleTitleOn constant composition codes over Z q IEEE Trans Inform Theory 49 IssueID11 3010–3016 Occurrence Handle2027580 Occurrence Handle10.1109/TIT.2003.819339

    Article  MathSciNet  Google Scholar 

  14. Ray-Chaudhuri DK, Wilson RM (1971) Solution of Kirkman’s schoolgirl problem. In: Motzkin TS (ed) Combinatorics, Proceedings of Symposia in Pure Mathematics, Vol. 19, American Mathematical Society, Providence, pp 187–203

  15. NV Semakov VA Zinoviev (1968) ArticleTitleEquidistant q-ary codes with maximal distance and resolvable balanced incomplete block designs Probl Inform Transmission 4 IssueID2 1–7

    Google Scholar 

  16. NV Semakov VA Zinoviev GV Zaitsev (1969) ArticleTitleA class of maximal equidistant codes Probl Inform Transmission 5 IssueID2 65–68

    Google Scholar 

  17. Stinson DR, (2004) Combinatorial designs: constructions and analysis. Springer-Verlag, New York, Inc.

  18. M Svanström (2000) ArticleTitleConstruction of ternary constant-composition codes with weight three IEEE Trans Inform Theory 46 IssueID7 2644–2647 Occurrence Handle0999.94048 Occurrence Handle1806826 Occurrence Handle10.1109/18.887875

    Article  MATH  MathSciNet  Google Scholar 

  19. M Svanström PRJ Östergård GT Bogdanova (2002) ArticleTitleBounds and constructions for ternary constant- composition codes IEEE Trans Inform Theory 48 IssueID1 101–111 Occurrence Handle1059.94046 Occurrence Handle1872166 Occurrence Handle10.1109/18.971741

    Article  MATH  MathSciNet  Google Scholar 

  20. VA Zinoviev (1983) ArticleTitleCascade equal-weight codes and maximal packings Probl Control Inform Theory 12 IssueID1 3–10 Occurrence Handle0529.94013 Occurrence Handle710794

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Hong Kong University of Science and Technology, Clearwater Bay, Kowloon, Hong Kong, China

    Cunsheng Ding

  2. Department of Mathematics, Suzhou University, Suzhou, 215006, China

    Jianxing Yin

Authors
  1. Cunsheng Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianxing Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianxing Yin.

Additional information

Communicated by C.J. Colbourn.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ding, C., Yin, J. A Construction of Optimal Constant Composition Codes. Des Codes Crypt 40, 157–165 (2006). https://doi.org/10.1007/s10623-006-0004-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-006-0004-8

Keywords

AMS Classification

Search

Navigation