Binomial moments for divisible self-dual codes | Zendy

Iwan Duursma | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Binomial moments for divisible self-dual codes

Author(s) -

Iwan Duursma

Publication year - 2010

Publication title -

international journal of information and coding theory

Language(s) - English

Resource type - Journals

eISSN - 1753-7711

pISSN - 1753-7703

DOI - 10.1504/ijicot.2010.032134

Subject(s) - mathematics , combinatorics , upper and lower bounds , binomial (polynomial) , bounded function , dual (grammatical number) , integer (computer science) , singleton , discrete mathematics , constant (computer programming) , moment (physics) , statistics , computer science , physics , mathematical analysis , pregnancy , art , literature , biology , genetics , programming language , classical mechanics

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 Krasikov-Litsyn and Rains. 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research