nach oben

Designs, Codes and Cryptography

Erschienen in:

01.01.2015

Two series of equitable symbol weight codes meeting the Plotkin bound

verfasst von: Peipei Dai, Jianmin Wang, Jianxing Yin

Erschienen in: Designs, Codes and Cryptography | Ausgabe 1/2015

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

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.

Vorheriger Artikel On cyclic codes over the ring

Nächster Artikel New bounds on -separable codes of length 2

Nur mit Berechtigung zugänglich

Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1999).

Blake I.F., Mullin R.C.: An Introduction to Algebraic and Combinatorial Coding Theory. Academic Press, New York (1976).

Bogdanova G., Todorov T., Zinoviev V.A.: On construction of \(q\)-ary equidistant codes. Probl. Inf. Transm. 43, 13–36 (2007).

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–675 (2012).

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–670 (2012).

Chee Y.M., Kiah H., Wang C.: Generalized balanced tournament designs with block size four, Preprint.

Colbourn C.J., Dinitz J.H.: The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (2007).

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–196 (2002).

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–490 (1990).

11.

Lamken E.R.: Existence results for generalized balanced tournament designs with block size 3. Des. Codes Cryptogr. 3, 33–61 (1992).

12.

Lamken E.R.: Constructions for generalized balanced tournament designs. Discret. Math. 131, 127–151 (1994).

13.

Rosa A., Vanstone S.A.: Starter–adder techniques for Kirkman squares and Kirkman cubes of small sides. Ars Combin. 14, 199–212 (1982).

14.

Schellenberg P.J., Van Rees G.H.J., Vanstone S.A.: The existence of balanced tournament designs. Ars Combin. 3, 303–318 (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–10 (1968). [Probl. Inf. Trans. (Engl. Transl.) 4(2), 1–7 (1968).]

16.

Semakov N.V., Zaitsev G.V., Zinoviev V.A.: A class of maximal equidistant codes. Probl. Peredachi Inf. 5(2), 84–87 (1969). [Probl. Inf. Trans. (Engl. Transl.) 5(2), 65–68 (1969).]

17.

Shan X.: Near generalized balanced tournament designs with block sizes 4 and 5. Sci. China Ser. A. 50, 1382–1388 (2007).

18.

Stanton R.G., Mullin R.C.: Construction of room squares. Ann. Math. Stat. 39, 1540–1548 (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–2678 (2008).

22.

Yan J., Yin J.: A class of optimal constant composition codes from GDRPs. Des. Codes Cryptogr. 50, 61–76 (2009).

23.

Yin J., Yan J., Wang C.: Generalized balanced tournament designs and related codes. Des. Codes Cryptogr. 46, 211–230 (2008).

Titel: Two series of equitable symbol weight codes meeting the Plotkin bound
verfasst von: Peipei Dai
Jianmin Wang
Jianxing Yin
Publikationsdatum: 01.01.2015
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 1/2015
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-013-9846-z

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 1/2015

On the minimum number of points covered by a set of lines in

Spectrum of sizes for perfect 2-deletion-correcting codes of length 4

Binary and -ary Tardos codes, revisited

Beyond eCK: perfect forward secrecy under actor compromise and ephemeral-key reveal

Symmetric doubly dual hyperovals have an odd rank

False Negative probabilities in Tardos codes