On explicit minimum weight bases for extended cyclic codes related to Gold functions

I. Y. Mogilnykh, F. I. Solov’eva

Результат исследования: Научные публикации в периодических изданияхстатья

1 Цитирования (Scopus)

Аннотация

Minimum weight bases of some extended cyclic codes can be chosen from the affine orbits of certain explicitly represented minimum weight codewords. We find such bases for the following three classes of codes: the extended primitive 2-error correcting BCH code of length n= 2 m, where m≥ 4 (for m≥ 20 the result was proven in Grigorescu and Kaufman IEEE Trans Inf Theory 58(I. 2):78–81, 2011), the extended cyclic code C¯ 1 , 5 of length n= 2 m, odd m, m≥ 5 , and the extended cyclic codes C¯1,2i+1 of lengths n= 2 m, (i,m)=1 and 3≤i≤m-54-o(m).

Язык оригиналаанглийский
Страницы (с-по)2619-2627
Число страниц9
ЖурналDesigns, Codes, and Cryptography
Том86
Номер выпуска11
DOI
СостояниеОпубликовано - 1 ноя 2018

    Fingerprint

Цитировать