Optimal binary linear complementary pairs from Solomon-Stiffler codes

DOI10.1109/TIT.2023.3287853MaRDI QIDQ6574983zbMATH OpenFDO

Authors Cem Güneri

Publication date 19 July 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

minimum distanceGriesmer boundsecurity parameterbinary linear complementary pair of codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

This page was built for publication: Optimal binary linear complementary pairs from Solomon-Stiffler codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574983)