Özbudak, Ferruh and Özkaya, Buket (2024) New distance bounds for quasi-cyclic codes. Designs, Codes, and Cryptography, 92 (12). pp. 3981-4009. ISSN 0925-1022 (Print) 1573-7586 (Online)
This is the latest version of this item.
Official URL: https://dx.doi.org/10.1007/s10623-024-01464-0
Abstract
We consider the minimum weight of codewords in a quasi-cyclic code and characterize the estimate in its most general setup using their concatenated structure. The new bound we derive generalizes the Jensen and Güneri–Özbudak bounds and it holds for the more general class of multilevel concatenated codes.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | 11T71; 94B60; 94B65; Concatenated structure; Minimum distance bounds; Quasi-cyclic codes |
| Divisions: | Faculty of Engineering and Natural Sciences > Basic Sciences > Mathematics Faculty of Engineering and Natural Sciences |
| Depositing User: | Ferruh Özbudak |
| Date Deposited: | 08 Oct 2025 12:38 |
| Last Modified: | 08 Oct 2025 12:38 |
| URI: | https://research.sabanciuniv.edu/id/eprint/52945 |
Available Versions of this Item
-
New distance bounds for quasi-cyclic codes. (deposited 27 Aug 2024 10:17)
- New distance bounds for quasi-cyclic codes. (deposited 08 Oct 2025 12:38) [Currently Displayed]
Actions (login required)
- View Item