On construction of linear (Euclidean) hull codes over finite extensions binary fields

DOI10.1007/S10623-025-01757-YMaRDI QIDQ6878997zbMATH OpenFDO

Authors Sanjit Bhowmick, Deepak Kumar Dalai, Sihem Mesnager

Publication date 5 January 2026

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1007/S10623-025-01757-Y

zbMATH Keywords

dual codehull of a linear codeLCD codelinear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cites work

• A new construction of linear codes with one-dimensional hull
• Affine and projective planes
• Complementary dual codes for counter-measures to side-channel attacks
• Constructing quantum error-correcting codes that require a variable amount of entanglement
• Constructions of good entanglement-assisted quantum error correcting codes
• Constructions of Linear Codes With One-Dimensional Hull
• Explicit Constructions of MDS Self-Dual Codes
• scientific article; zbMATH DE number 6900653 (Why is no real title available?)
• Linear codes with complementary duals
• Linear codes with small hulls in semi-primitive case
• MDS linear codes with one-dimensional hull
• On Linear Codes With One-Dimensional Euclidean Hull and Their Applications to EAQECCs
• On the Hull-Variation Problem of Equivalent Linear Codes
• Relative hulls and quantum codes

This page was built for publication: On construction of linear (Euclidean) hull codes over finite extensions binary fields

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