We demonstrate that certain sets of binary sequences derived from irreducible cyclic codes have good correlation properties. We give explicit numerical examples, and theoretical bounds. Both even (periodic) and odd (aperiodic) correlation properties are treated
Levenshtein improved the famous Welch bound on aperiodic correlation for binary sequences by utiliz...
First, some general properties of codes which are invariant under the permutation groups are given. ...
Partial words are strings over a finite alphabet that may contain a number of “do not know ” symbols...
We demonstrate that certain sets of binary sequences derived from irreducible cyclic codes have good...
International audienceThis paper concerns the study of the correlation measures of finite binary seq...
AbstractThis paper concerns the study of the correlation measures of finite binary sequences, more p...
The focus of the research work was on the theory of sequences and their properties with efforts on c...
We present an overview of results concerning partial periodic correlation of pseudorandom sequences,...
For the case where p is an odd prime, n>or=2 is an integer, and omega is a complex primitive pth...
This thesis is dedicated to exploring sequences with good correlation properties. Periodic sequences...
The correlation properties of the majority of sequences are investigated. Experimental data on the c...
In this paper there are solved two related problems: the development of the method and correspondent...
As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive se...
correlations of some p-ary sequences from Galois rings. IEICE transactions on fundamentals of electr...
Levenshtein improved the famous Welch bound on aperiodic correlation for binary sequences by utiliz...
Levenshtein improved the famous Welch bound on aperiodic correlation for binary sequences by utiliz...
First, some general properties of codes which are invariant under the permutation groups are given. ...
Partial words are strings over a finite alphabet that may contain a number of “do not know ” symbols...
We demonstrate that certain sets of binary sequences derived from irreducible cyclic codes have good...
International audienceThis paper concerns the study of the correlation measures of finite binary seq...
AbstractThis paper concerns the study of the correlation measures of finite binary sequences, more p...
The focus of the research work was on the theory of sequences and their properties with efforts on c...
We present an overview of results concerning partial periodic correlation of pseudorandom sequences,...
For the case where p is an odd prime, n>or=2 is an integer, and omega is a complex primitive pth...
This thesis is dedicated to exploring sequences with good correlation properties. Periodic sequences...
The correlation properties of the majority of sequences are investigated. Experimental data on the c...
In this paper there are solved two related problems: the development of the method and correspondent...
As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive se...
correlations of some p-ary sequences from Galois rings. IEICE transactions on fundamentals of electr...
Levenshtein improved the famous Welch bound on aperiodic correlation for binary sequences by utiliz...
Levenshtein improved the famous Welch bound on aperiodic correlation for binary sequences by utiliz...
First, some general properties of codes which are invariant under the permutation groups are given. ...
Partial words are strings over a finite alphabet that may contain a number of “do not know ” symbols...
DOI
Add to ORKG