Obtaining new classes of optimal linear codes by puncturing and shortening optimal cyclic codes
Crossref DOI link: https://doi.org/10.1007/s00200-024-00653-7
Published Online: 2024-04-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Hernández, Félix
Vega, Gerardo
Text and Data Mining valid from 2024-04-06
Version of Record valid from 2024-04-06
Article History
Received: 19 October 2023
Revised: 20 February 2024
Accepted: 24 February 2024
First Online: 6 April 2024
Declarations
:
: The authors declare that they have no Conflict of interest.