Co-Orthogonal Codes

Authors:
Vince Grolmusz
Affiliations:
Department of Computer Science, Eötvös University, Budapest, Hungary H-1117
Venue:
Designs, Codes and Cryptography
Year:
2006

Citing 2
Cited 0

Representing Boolean functions as polynomials modulo composite numbers

Computational Complexity - Special issue on circuit complexity
Constructing set systems with prescribed intersection sizes

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define, construct and sketch possible applications of a new class of non-linear codes: co-orthogonal codes, with possible applications in cryptography and parallel processing. We also describe a fast and general method for generating (non-linear) codes with prescribed dot-products with the help of multi-linear polynomials.