Complementary information set codes over \(\mathrm{GF}(p)\)
From MaRDI portal
Publication:329198
DOI10.1007/s10623-015-0174-3zbMath1396.94110MaRDI QIDQ329198
Publication date: 21 October 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0174-3
equivalence; self-dual code; CIS codes; complementary information set code; correlation immune; Gilbert-Vashamov bound
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94B05: Linear codes (general theory)
Related Items
CIS codes over ${\mathbb F}_4$, \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays, Construction of single-deletion-correcting DNA codes using CIS codes
Uses Software
Cites Work
- Classification of self-dual codes of length 36
- Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography
- Euclidean and Hermitian self-dual MDS codes over large finite fields.
- 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
- AN EFFICIENT CONSTRUCTION OF SELF-DUAL CODES
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item