\(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays
From MaRDI portal
Publication:516891
DOI10.1016/j.dam.2016.09.032zbMath1358.05043OpenAlexW2534931163MaRDI QIDQ516891
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.032
equivalenceself-dual codeorthogonal arrayoptimal codecomplementary information set codecorrelation immune
Related Items (2)
Construction of orthogonal arrays of strength three by augmented difference schemes ⋮ CIS codes over ${\mathbb F}_4$
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complementary information set codes over \(\mathrm{GF}(p)\)
- On sets of Boolean \(n\)-vectors with all \(k\)-projections surjective
- Explicit construction of exponential sized families of k-independent sets
- On the maximum number of qualitative independent partitions
- Optimal ternary linear codes
- Orthogonal arrays. Theory and applications
- Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography
- Families of \(k\)-independent sets
- Higher-Order CIS Codes
- A New Class of Codes for Boolean Masking of Cryptographic Computations
- Logic Test Pattern Generation Using Linear Codes
- Vector sets for exhaustive testing of logic circuits
- Optimal linear codes of dimension 4 over F/sub 5/
- New extremal self-dual codes of lengths 36, 38, and 58
- AN EFFICIENT CONSTRUCTION OF SELF-DUAL CODES
This page was built for publication: \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays
