Advertisement

Co-orthogonal Codes

Extended Abstract
  • Vince Grolmusz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2387)

Abstract

We define, construct and sketch possible applications of a new class of non-linear codes: co-orthogonal codes. The advantages of these codes are twofold: first, it is easy to decide whether two codewords form a unique pair (this can be used in decoding information or identifying users of some not-publicly-available or non-free service on the Internet or elsewhere), and the identification process of the unique pair can be distributed between entities, who perform easy tasks, and only the information, gathered from all of them would lead to the result of the identifying process: the entities, taking part in the process will not have enough information to decide or just to conjecture the outcome of the identification process.

Moreover, we describe a fast (and general) method for generating (non-linear) codes with prescribed dot-products with the help of multi-linear polynomials.

Keywords

non-linear codes co-orthogonal codes codes and set-systems multi-linear polynomials composite modulus 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    David A. Mix Barrington, Richard Beigel, and Steven Rudich. Representing Boolean functions as polynomials modulo composite numbers. Comput. Complexity, 4:367–382, 1994. Appeared also in Proc. 24th Ann. ACM Symp. Theor. Comput., 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Vince Grolmusz. Low-rank co-diagonal matrices and Ramsey graphs. The Electronic Journal of Combinatorics, 7:R15, 2000. http://www.combinatorics.org.MathSciNetGoogle Scholar
  3. 3.
    Vince Grolmusz. Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs. Combinatorica, 20:73–88, 2000.CrossRefMathSciNetGoogle Scholar
  4. 4.
    Vince Grolmusz. Constructing set-systems with prescribed intersection sizes. Technical Report DIMACS TR 2001-03, DIMACS, January 2001. ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2001/2001-03.ps.gz.
  5. 5.
    Vince Grolmusz. Set-systems with restricted multiple intersections and explicit Ramsey hypergraphs. Technical Report DIMACS TR 2001-04, DIMACS, January 2001. ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2001/2001-04.ps.gz.
  6. 6.
    Zoltán Király. personal communication.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Vince Grolmusz
    • 1
    • 2
  1. 1.Department of Computer ScienceEötvös UniversityBudapest
  2. 2.BudapestHungary

Personalised recommendations