On the minimum weights of binary linear complementary dual codes
From MaRDI portal
Publication:2179521
DOI10.1007/s12095-019-00402-5zbMath1434.94081arXiv1807.03525OpenAlexW2850968244WikidataQ127130471 ScholiaQ127130471MaRDI QIDQ2179521
Publication date: 12 May 2020
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.03525
Related Items (11)
Characterization and classification of optimal LCD codes ⋮ Group LCD and group reversible LCD codes ⋮ Optimal quaternary linear codes with one-dimensional Hermitian hull and related EAQECCs ⋮ On Toeplitz codes of index \(t\) and isometry codes ⋮ An improved method for constructing formally self-dual codes with small hulls ⋮ Construction for both self-dual codes and LCD codes ⋮ New constructions of optimal binary LCD codes ⋮ Optimal binary linear complementary pairs of codes ⋮ Optimal binary LCD codes ⋮ LCD codes from tridiagonal Toeplitz matrices ⋮ On the minimum weights of binary LCD codes and ternary LCD codes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Complementary dual codes for counter-measures to side-channel attacks
- Linear codes with complementary duals
- The \([18,9,6\) code is unique]
- Uniqueness of some linear subcodes of the extended binary Golay code
- The Magma algebra system. I: The user language
- Optimal binary linear codes of length \(\leq 30\)
- The combinatorics of LCD codes: linear programming bound and orthogonal matrices
- Some bounds on binary LCD codes
- Binary optimal linear rate 1/2 codes
- The \([23,14,5\) Wagner code is unique]
- Binary linear complementary dual codes
- Practical graph isomorphism. II.
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
- New Characterization and Parametrization of LCD Codes
- A Bound for Error-Correcting Codes
- Binary optimal odd formally self-dual codes.
This page was built for publication: On the minimum weights of binary linear complementary dual codes
