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/978-3-319-00017-6_8

Search In DOI:

ISSN

1573-7586

Search In ISSN:
Search In Title Of Papers:

A tight asymptotic bound on the size of constantw

Authors: Kenneth W Shum Wing Shing Wong
Publish Date: 2009/11/17
Volume: 57, Issue: 1, Pages: 1-14
PDF Link

Abstract

In the study of multipleaccess in the collision channel conflictavoiding code is used to guarantee that each transmitting user can send at least one packet successfully in the worst case within a fixed period of time provided that at most k users out of M potential users are active simultaneously The number of codewords in a conflictavoiding code determines the number of potential users that can be supported in a system Previously upper bound on the size of conflictavoiding code is known only for Hamming weights three four and five The asymptotic upper in this paper extends the known results to all Hamming weights and is proved to be tight by exhibiting infinite sequences of conflictavoiding codes which meet this bound asymptotically for all Hamming weights

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. Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes
  10. A new table of permutation codes
  11. Bent functions embedded into the recursive framework of $${\mathbb{Z}}$$ -bent functions
  12. Nonexistence of CW (110, 100)
  13. Point compression for the trace zero subgroup over a small degree extension field
  14. The Diffie–Hellman problem and generalization of Verheul’s theorem
  15. Modular independence and generator matrices for codes over $${\mathbb {Z}_m}$$
  16. Improved lower bounds on sizes of single-error correcting codes
  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: