Please use this identifier to cite or link to this item:
|Title:||New bounds on the minimum distance of cyclic codes||Authors:||Ling, San
|Keywords:||Science::Mathematics::Applied mathematics::Information theory||Issue Date:||2021||Source:||Ling, S., & Özkaya, B. (2021). New bounds on the minimum distance of cyclic codes. Advances in Mathematics of Communications, 15(1). doi:10.3934/amc.2020038||Journal:||Advances in Mathematics of Communications||Abstract:||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.||URI:||https://hdl.handle.net/10356/146495||ISSN:||1930-5338||DOI:||10.3934/amc.2020038||Rights:||© 2021 American Institute of Mathematical Sciences (AIMS). All rights reserved.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Updated on Jul 4, 2022
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.