CIS codes over ${\mathbb F}_4$
From MaRDI portal
Publication:5118348
DOI10.11568/kjm.2020.28.2.285zbMath1446.94182OpenAlexW3038609287MaRDI QIDQ5118348
Publication date: 8 September 2020
Full work available at URL: http://journal.kkms.org/index.php/kjm/article/view/944/537
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Complementary information set codes over \(\mathrm{GF}(p)\)
- Classification of self-dual codes of length 36
- \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays
- The existence of a self-dual \([70 ,35 ,12\) code and formally self-dual codes.]
- Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography
- The Magma algebra system. I: The user language
- Euclidean and Hermitian self-dual MDS codes over large finite fields.
- Three characterizations of non-binary correlation-immune and resilient functions
- Higher-Order CIS Codes
- A New Class of Codes for Boolean Masking of Cryptographic Computations
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- New extremal self-dual codes of lengths 36, 38, and 58
This page was built for publication: CIS codes over ${\mathbb F}_4$