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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. A. M. Barrington, R. Beigel and S. Rudich. Representing Boolean functions as polynomials modulo composite numbers. Computational Complexity, Vol. 4 (1994) pp. 367–382. Appeared also in Proc. 24th Ann. ACM Symp. Theor. Comput., 1992.
V. Grolmusz. Low-rank co-diagonal matrices and Ramsey graphs. The Electronic Journal of Combinatorics, Vol. 7 Issue No. R15 (2000). www.combinatorics.org.
V. Grolmusz (2000) ArticleTitleSuperpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs Combinatorica 20 73–88 Occurrence Handle10.1007/s004930070032 Occurrence Handle2001d:05192
V. Grolmusz (2002) ArticleTitleConstructing set-systems with prescribed intersection sizes Journal of Algorithms 44 321–337 Occurrence Handle10.1016/S0196-6774(02)00204-3 Occurrence Handle1014.68122 Occurrence Handle2003g:05127
V. Grolmusz. Set-systems with restricted multiple intersections. The Electronic Journal of Combinatorics, Vol. 9 (2002).
Z. Király. Personal communication.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by: V. Zinoviev
Rights and permissions
About this article
Cite this article
Grolmusz, V. Co-Orthogonal Codes. Des Codes Crypt 38, 363–372 (2006). https://doi.org/10.1007/s10623-005-1495-4
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-005-1495-4