Two series of equitable symbol weight codes meeting the Plotkin bound

详细信息    查看全文

• 作者：Peipei Dai ; Jianmin Wang ; Jianxing Yin
• 关键词：Equitable symbol weight codes ; Optimality ; Designs ; Primary 05B05 ; 94B25
• 刊名：Designs, Codes and Cryptography
• 出版年：2015
• 出版时间：January 2015
• 年：2015
• 卷：74
• 期：1
• 页码：15-29
• 全文大小：220 KB
• 参考文献：1. Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1999).
  2. Blake I.F., Mullin R.C.: An Introduction to Algebraic and Combinatorial Coding Theory. Academic Press, New York (1976).
  3. Bogdanova G., Todorov T., Zinoviev V.A.: On construction of \(q\) -ary equidistant codes. Probl. Inf. Transm. 43, 13-6 (2007).
  4. Chee Y.M., Kiah H., Ling A., Wang C.: Optimal equitable symbol weight codes for power line communications. In: ISIT 2012—Proceedings of the 2012 IEEE International Symposium on Information Theory, Cambridge, pp. 671-75 (2012).
  5. Chee Y.M., Kiah H., Purkayastha P., Wang C.: Importance of symbol equity in coded modulation for power line communications. In: ISIT 2012—Proceedings of the 2012 IEEE International Symposium on Information Theory, Cambridge, pp. 666-70 (2012).
  6. Chee Y.M., Kiah H., Wang C.: Generalized balanced tournament designs with block size four, Preprint.
  7. Colbourn C.J., Dinitz J.H.: The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (2007).
  8. Colbourn C.J., Lamken E.R., Ling A.C.H., Mills W.H.: The existence of Kirkman squares-doubly resolvable \((v, 3, 1)\) -BIBDs. Des. Codes Cryptogr. 26, 169-96 (2002).
  9. Furino S.C., Miao Y., Yin J.: Frames and Resolvable Designs. CRC Press, Boca Raton (1996).
  10. Lamken E.R.: Generalized balanced tournament designs. Trans. Am. Math. Soc. 318, 473-90 (1990).
  11. Lamken E.R.: Existence results for generalized balanced tournament designs with block size 3. Des. Codes Cryptogr. 3, 33-1 (1992).
  12. Lamken E.R.: Constructions for generalized balanced tournament designs. Discret. Math. 131, 127-51 (1994).
  13. Rosa A., Vanstone S.A.: Starter–adder techniques for Kirkman squares and Kirkman cubes of small sides. Ars Combin. 14, 199-12 (1982).
  14. Schellenberg P.J., Van Rees G.H.J., Vanstone S.A.: The existence of balanced tournament designs. Ars Combin. 3, 303-18 (1977).
  15. Semakov N.V., Zinoviev V.A.: Equidistant \(q\) -ary codes with maximal distance and resolvable balanced incomplete block designs. Probl. Peredachi Inf. 4(2), 3-0 (1968). [Probl. Inf. Trans. (Engl. Transl.) 4(2), 1- (1968).]
  16. Semakov N.V., Zaitsev G.V., Zinoviev V.A.: A class of maximal equidistant codes. Probl. Peredachi Inf. 5(2), 84-7 (1969). [Probl. Inf. Trans. (Engl. Transl.) 5(2), 65-8 (1969).]
  17. Shan X.: Near generalized balanced tournament designs with block sizes 4 and 5. Sci. China Ser. A. 50, 1382-388 (2007).
  18. Stanton R.G., Mullin R.C.: Construction of room squares. Ann. Math. Stat. 39, 1540-548 (1968).
  19. Yan J., Wang C.: The existence of FGDRP \((3, g^u)\) ’s. Electron. J. Comb. 16, 1 (2009).
  20. Yan J., Wang C.: The existence of near generalized balanced tournament designs. Electron. J. Comb. 19, 2 (2012).
  21. Yan J., Yin J.: Constructions of optimal GDRP \((n,\lambda ; v)\) ’s of type \(\lambda ^1\mu ^{m-1}\) . Discret. Appl. Math. 156, 2666-678 (2008).
  22. Yan J., Yin J.: A class of optimal constant composition codes from GDRPs. Des. Codes Cryptogr. 50, 61-6 (2009).
  23. Yin J., Yan J., Wang C.: Generalized balanced tournament designs and related codes. Des. Codes Cryptogr. 46, 211-30 (2008).
  
• 作者单位：Peipei Dai (1)
  Jianmin Wang (1)
  Jianxing Yin (1)
  
  1. Department of Mathematics, Soochow University, Suzhou, 215006, People’s Republic of China
  
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics
  Combinatorics
  Coding and Information Theory
  Data Structures, Cryptology and Information Theory
  Data Encryption
  Discrete Mathematics in Computer Science
  Information, Communication and Circuits
  
• 出版者：Springer Netherlands
• ISSN：1573-7586

文摘

A \(q\) -ary code of length \(n\) is termed an equitable symbol weight code, if each symbol appears among the coordinates of every codeword either \(\lfloor n/q \rfloor \) or \(\lceil n/q \rceil \) times. This class of codes was proposed recently by Chee et al. in order to more precisely capture a code’s performance against permanent narrowband noise in power line communication. In this paper, two series of new equitable symbol weight codes of optimal sizes meeting the Plotkin bound are constructed via combinatorial designs.