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

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

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

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).

Original languageEnglish
Pages (from-to)2619-2627
Number of pages9
JournalDesigns, Codes, and Cryptography
Volume86
Issue number11
DOIs
Publication statusPublished - 1 Nov 2018

Keywords

  • Cyclic codes
  • Explicit basis
  • Gold function
  • Minimal weight basis

Fingerprint Dive into the research topics of 'On explicit minimum weight bases for extended cyclic codes related to Gold functions'. Together they form a unique fingerprint.

Cite this