On a Theorem of Kyureghyan and Pott

10/05/2018
by   Minglong Qi, et al.
0

In the paper of Gohar M. Kyureghyan and Alexander Pott (Designs, Codes and Cryptography, 29, 149-164, 2003), the linear feedback polynomials of the Sidel'nikov-Lempel-Cohn-Eastman sequences were determined for some special cases. When referring to that paper, we found that Corollary 4 and Theorem 2 of that paper are wrong because there exist many counterexamples for these two results. In this note, we give some counterexamples of Corollary 4 and Theorem 2 of that paper.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/02/2019

New Kloosterman sum identities from the Helleseth-Zinoviev result on Z_4-linear Goethals codes

In the paper of Tor Helleseth and Victor Zinoviev (Designs, Codes and Cr...
research
08/18/2022

A note on the Assmus–Mattson theorem for some binary codes II

Let C be a four-weight code, which has all one vector. Furthermore, we a...
research
09/15/2023

A note on the Assmus–Mattson theorem for some non-binary codes (a resume)

Let C be a two and three-weight ternary code. Furthermore, we assume tha...
research
07/30/2019

Codes, differentially δ-uniform functions and t-designs

Special functions, coding theory and t-designs have close connections an...
research
01/26/2019

Steiner systems S(2, 4, 3^m-1/2) and 2-designs from ternary linear codes of length 3^m-1/2

Coding theory and t-designs have close connections and interesting inter...
research
07/31/2019

Deduction Theorem: The Problematic Nature of Common Practice in Game Theory

We consider the Deduction Theorem that is used in the literature of game...
research
04/02/2020

Gopala-Hemachandra codes revisited

Gopala-Hemachandra codes are a variation of the Fibonacci universal code...

Please sign up or login with your details

Forgot password? Click here to reset