Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Des Codes Cryptogr

Search In Journal Title:

Abbravation: Designs, Codes and Cryptography

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1007/s11517-015-1275-x

Search In DOI:

ISSN

1573-7586

Search In ISSN:
Search In Title Of Papers:

On the correlation distribution of Delsarte–Goetha

Authors: KaiUwe Schmidt
Publish Date: 2011/01/05
Volume: 59, Issue: 1-3, Pages: 333-347
PDF Link

Abstract

For odd integer m ≥ 3 and t=01ldotsfracm12 we define Family fancyscriptVt to be a set of size 2mt+1 containing binary sequences of period 2m+1 − 2 The nontrivial correlations between sequences in Family fancyscriptVt are bounded in magnitude by 2 + 2m+1/2+t Families fancyscriptV0 and fancyscriptV1 compare favourably to the small and large Kasami sets respectively So far the correlation distribution of Family fancyscriptVt is only known for t = 0 A general framework for computing the correlation distribution of Family fancyscriptVt is established The correlation distribution of fancyscriptV1 is derived and a way to obtain the correlation distribution of fancyscriptV2 is described

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Composition of recursions and nonlinear complexity of periodic binary sequences
  2. Practical-time attacks against reduced variants of MISTY1
  3. On the largest affine sub-families of a family of NFSR sequences
  4. The dimension of subcode-subfields of shortened generalized Reed–Solomon codes
  5. On explicit factors of cyclotomic polynomials over finite fields
  6. Two classes of optimal two-dimensional OOCs
  7. Sequences with small correlation
  8. Improved algorithms for finding low-weight polynomial multiples in $$\mathbb {F}_{2}^{}[x]$$ and some cryptographic applications
  9. A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
  10. Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes
  11. A new table of permutation codes
  12. Bent functions embedded into the recursive framework of $${\mathbb{Z}}$$ -bent functions
  13. Nonexistence of CW (110, 100)
  14. Point compression for the trace zero subgroup over a small degree extension field
  15. The Diffie–Hellman problem and generalization of Verheul’s theorem
  16. Modular independence and generator matrices for codes over $${\mathbb {Z}_m}$$
  17. Improved lower bounds on sizes of single-error correcting codes
  18. A combinatorial problem related to sparse systems of equations
  19. Some results concerning cryptographically significant mappings over GF(2 n )
  20. A note on the reducibility of binary affine polynomials
  21. Primitive normal bases for quartic and cubic extensions: a geometric approach
  22. Computing isogenies between supersingular elliptic curves over $${\mathbb {F}}_p$$
  23. Some cyclic codes of length 2 p n
  24. Algebraic decoding of folded Gabidulin codes
  25. Inner balance of symmetric designs
  26. On the construction of Griesmer codes of dimension 5
  27. Applications of representation theory to wireless communications
Search Result: