Binomial moments for divisible self-dual codes

DOI10.1504/IJICOT.2010.032134MaRDI QIDQ622780zbMATH OpenFDO

Authors Iwan Duursma

Publication date 4 February 2011

Published in International Journal of Information and Coding Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/IJICOT.2010.032134

zbMATH Keywords

binomial momentsdivisible codeslinear programming boundminimum distance boundself-dual codes

Mathematics Subject Classification ID

Convolutional codes (94B10) Bounds on codes (94B65)

Review text

Summary: For self-dual codes with all weights divisible by an integer greater than one, the minimum distance is bounded by the Mallows-Sloane upper bounds and by their improvements due to \textit{I. Krasikov, S. Litsyn} [IEEE Trans. Inf. Theory 46, No. 1, 274--278 (2000; Zbl 0997.94037)] and \textit{E. M. Rains} [IEEE Trans. Inf. Theory 49, No. 5, 1261--1274 (2003; Zbl 1063.94123)]. We obtain the improved upper bounds from short relations with constant coefficients on suitable binomial moments of the codes. In this approach, the Mallows-Sloane bounds are analogues of the Singleton bound and the improved bounds are analogues of the Plotkin bound.

Recommendations

• A bound for divisible codes
• Extremal weight enumerators and ultraspherical polynomials.
• An improved upper bound on the minimum distance of doubly-even self-dual codes
• Linear programming bounds for doubly-even self-dual codes
• Higher weights and binary self-dual codes

Cited in

(1)

• Binary divisible codes of maximum dimension

This page was built for publication: Binomial moments for divisible self-dual codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622780)