Some bounds on binary LCD codes
Authors:
Top Cited Papers
- 26 September 2017
- journal article
- research article
- Published by Springer Nature in Cryptography and Communications
- Vol. 10 (4) , 719-728
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Research Foundation of Korea (2016R1D1A1B03933259)
This publication has 10 references indexed in Scilit:
- The combinatorics of LCD codes: linear programming bound and orthogonal matricesInternational Journal of Information and Coding Theory, 2017
- Quasi-cyclic complementary dual codesFinite Fields and Their Applications, 2016
- Complementary Dual Codes for Counter-Measures to Side-Channel Attacks2015
- The principal rank characteristic sequence over various fieldsLinear Algebra and its Applications, 2014
- On complementary-dual quasi-cyclic codesFinite Fields and Their Applications, 2009
- Linear codes with complementary duals meet the Gilbert–Varshamov boundDiscrete Mathematics, 2004
- The condition for a cyclic code to have a complementary dualDiscrete Mathematics, 1994
- Linear codes with complementary dualsDiscrete Mathematics, 1992
- On the minimum distance of certain reversible cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1970
- Reversible codesInformation and Control, 1964