Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds
From MaRDI portal
Publication:4895632
DOI10.1137/S0895480194270950zbMath0862.05014MaRDI QIDQ4895632
K. Gopalakrishnan, Douglas R. Stinson, Juergen Bierbrauer
Publication date: 17 March 1997
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
linear programmingboundsanticodesorthogonal arrayserror-correcting codesresiliencyresilient functions
Linear codes (general theory) (94B05) Cryptography (94A60) Bounds on codes (94B65) Orthogonal arrays, Latin squares, Room squares (05B15) Boolean functions (94D10)
Related Items (9)
\(t\)-resilient functions and the partial exposure problem ⋮ New characterizations for the multi-output correlation-immune Boolean functions ⋮ Perfect 2‐colorings of Hamming graphs ⋮ The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes ⋮ The Fourier spectral characterization for the correlation-immune functions over \(\mathbb{F}_p \) ⋮ Proving the conjecture of O'Donnell in certain cases and disproving its general validity ⋮ Unnamed Item ⋮ On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays ⋮ Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization
This page was built for publication: Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds
