Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Des Codes Crypt

Search In Journal Title:

Abbravation: Designs, Codes and Cryptography

Search In Journal Abbravation:

Publisher

Kluwer Academic Publishers-Plenum Publishers

Search In Publisher:

DOI

10.1007/bf00022443

Search In DOI:

ISSN

1573-7586

Search In ISSN:
Search In Title Of Papers:

Improved lower bounds on sizes of singleerror cor

Authors: Simon Litsyn Beniamin Mounits
Publish Date: 2006/11/01
Volume: 42, Issue: 1, Pages: 67-72
PDF Link

Abstract

A construction of codes of length n = q + 1 and minimum Hamming distance 3 over GFqsetminus0 is given Substitution of the derived codes into a concatenation construction yields nonlinear binary singleerror correcting codes with better than known parameters In particular new binary singleerror correcting codes having more codewords than the best previously known in the range n ≤ 512 are obtained for the lengths 64–66 128–133 256–262 and 512

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. A combinatorial problem related to sparse systems of equations
  18. Some results concerning cryptographically significant mappings over GF(2 n )
  19. A note on the reducibility of binary affine polynomials
  20. Primitive normal bases for quartic and cubic extensions: a geometric approach
  21. Computing isogenies between supersingular elliptic curves over $${\mathbb {F}}_p$$
  22. Some cyclic codes of length 2 p n
  23. On the correlation distribution of Delsarte–Goethals sequences
  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: