New bounds on the minimum distance of cyclic codes | Zendy

San Ling | Zendy; Buket Özkaya | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

New bounds on the minimum distance of cyclic codes

Author(s) -

San Ling,

Buket Özkaya

Publication year - 2019

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.2020038

Subject(s) - mathematics , cyclic code , embedding , code (set theory) , product (mathematics) , combinatorics , upper and lower bounds , minimum distance , cyclic group , discrete mathematics , linear code , block code , algorithm , decoding methods , geometry , mathematical analysis , computer science , abelian group , set (abstract data type) , artificial intelligence , programming language

Two bounds on the minimum distance of cyclic codes are proposed. The first one generalizes the Roos bound by embedding the given cyclic code into a cyclic product code. The second bound also uses a second cyclic code, namely the non-zero-locator code, but is not directly related to cyclic product codes and it generalizes a special case of the Roos 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