An improved upper bound of the rate of euclidean superimposed codes

Zoltán Füredi, Miklos Ruszinkó

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

A family of n-dimensional unit norm vectors is an Euclidean superimposed code if the sums of any two distinct at most m-tuples of vectors are separated by a certain minimum Euclidean distance d. Ericson and Györfl [8] proved that the rate of such a code is between (log m)/4m and (log m)/m for m large enough. In this paper-improving the above long-standing best upper bound for the rate-it is shown that the rate is always at most (logm)/2m, i.e., the size of a possible superimposed code is at most the root of the size given in [8]. We also generalize these codes to other normed vector spaces.

Original languageEnglish
Pages (from-to)799-802
Number of pages4
JournalIEEE Transactions on Information Theory
Volume45
Issue number2
DOIs
Publication statusPublished - Dec 1 1999

Keywords

  • Codes
  • Growth rate
  • Superimposed geometric codes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'An improved upper bound of the rate of euclidean superimposed codes'. Together they form a unique fingerprint.

  • Cite this