Relationships between CCZ and EA equivalence classes and corresponding code invariants

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The purpose of this paper is to provide a brief survey of CCZ and EA equivalence for functions f : G → N where G and N are finite and N is abelian, and, for the case f : ℤmp → ℤmp, to investigate two codes derived from f, inspired by these equivalences. In particular we show the dimension of the kernel of each code determines a new invariant of the corresponding equivalence class. We present computational results for p = 2 and small m.

Cite

CITATION STYLE

APA

Horadam, K. J., & Villanueva, M. (2014). Relationships between CCZ and EA equivalence classes and corresponding code invariants. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8865, 3–17. https://doi.org/10.1007/978-3-319-12325-7_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free