A new upper bound on the rate of non-binary codes | Zendy

Yael BenHaim | Zendy; Simon Litsyn | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A new upper bound on the rate of non-binary codes

Author(s) -

Yael BenHaim,

Simon Litsyn

Publication year - 2007

Publication title -

advances in mathematics of communications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.601

H-Index - 26

eISSN - 1930-5346

pISSN - 1930-5338

DOI - 10.3934/amc.2007.1.83

Subject(s) - mathematics , binary number , hamming code , hamming weight , upper and lower bounds , combinatorics , hamming distance , constant (computer programming) , binary code , range (aeronautics) , discrete mathematics , hamming bound , hamming(7,4) , block code , statistics , arithmetic , decoding methods , mathematical analysis , materials science , computer science , composite material , programming language

New bounds on the rate of non-binary codes and non-binary constant weight codes are derived. The asymptotic forms of these bounds outperform known bounds in a wide range of distances. The method is based on analysis of subsets in products of Hamming and Johnson association schemes

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