14 citations · 17 across the 4 of their papers we have counts for
4 papers
Decoding of Repeated-Root Cyclic Codes up to New Bounds on Their Minimum Distance
Alexander Zeh, Markus Ulmschneider
The well-known approach of Bose, Ray-Chaudhuri and Hocquenghem and its generalization by Hartmann and Tzeng are lower bounds on the minimum distance of simple-root cyclic codes. We…
Optimal Binary Locally Repairable Codes via Anticodes
Natalia Silberstein, Alexander Zeh
This paper presents a construction for several families of optimal binary locally repairable codes (LRCs) with small locality (2 and 3). This construction is based on various antic…
Construction of Quasi-Cyclic Product Codes
Alexander Zeh, San Ling
Linear quasi-cyclic product codes over finite fields are investigated. Given the generating set in the form of a reduced Gr{ö}bner basis of a quasi-cyclic component code and the ge…
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…