2 citations · 7 across the 7 of their papers we have counts for
6 papers · 1 filter
Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes
Alexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau +1
Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a…
A New Bound on the Minimum Distance of Cyclic Codes Using Small-Minimum-Distance Cyclic Codes
Alexander Zeh, Sergey Bezzateev
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH…
Describing A Cyclic Code by Another Cyclic Code
Alexander Zeh, Sergey Bezzateev
A new approach to bound the minimum distance of -ary cyclic codes is presented. The connection to the BCH and the Hartmann--Tzeng bound is formulated and it is shown that for se…
Decoding Cyclic Codes up to a New Bound on the Minimum Distance
Alexander Zeh, Antonia Wachter, Sergey Bezzateev
A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartm…
Cumulative-Separable Codes
Sergey Bezzateev, Natalia Shekhunova
q-ary cumulative-separable -codes and are considered. The relation between different codes f…
Chain of Separable Binary Goppa Codes and their Minimal Distance
Sergey Bezzateev, Natalia Shekhunova
It is shown that subclasses of separable binary Goppa codes, - codes, with and special Goppa polynomials G(x) can be presented as a cha…